The Graph Segmentation Problem

  • We investigate a graph theoretical problem arising in the automatic billing of a network toll. Given a network and a family of user paths, we study the graph segmentation problem (GSP) to cover parts of the user paths by a set of disjoint segments. The GSP is shown to be NP-hard but for special cases it can be solved in polynomial time. We also show that the marginal utility of a segment is bounded. Computational results for real-world instances show that in practice the problem is more amenable than the theoretic bounds suggest.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ralf Borndörfer, Stephan Schwartz, Gerald Bartz
Document Type:In Proceedings
Parent Title (English):INOC 2017 – 8th International Network Optimization Conference
Volume:64
First Page:35
Last Page:44
Series:Electronic Notes in Discrete Mathematics
Year of first publication:2018
Preprint:urn:nbn:de:0297-zib-60750