Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

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

Author:Stephan SchwartzORCiD, Ralf BorndörferORCiD, Gerald Bartz
Document Type:ZIB-Report
Tag:combinatorial optimization; graph segmentation; toll billing
Date of first Publication:2016/01/11
Series (Serial Number):ZIB-Report (16-53)
Published in:INOC 2017 – 8th International Network Optimization Conference
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.