The Graph Segmentation Problem

Please always quote using this URN: urn:nbn:de:0297-zib-60750
  • 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.

Download full text files

Export metadata

  • Export Bibtex
Metadaten
Author:Stephan Schwartz, Ralf Borndörfer, Gerald Bartz
Document Type:ZIB-Report
Tag:combinatorial optimization; graph segmentation; toll billing
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
Date of first Publication:2016/01/11
Series (Serial Number):ZIB-Report (16-53)
ISSN:1438-0064

$Rev: 13581 $