论文信息 - Line planning, path constrained network flow and inapproximability

Line planning, path constrained network flow and inapproximability

We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed maximally along all possible lines? The essence of this problem is the path constrained network flow (PCN) problem. We explore the complexity of this problem and its dual. In particular we show for the primal that it is as hard to approximate as MAX CLIQUE and for the dual that it is as hard to approximate as SET COVER. We also prove that the PCN problem is hard for special graph classes, interesting both from a complexity and from a practical perspective. Finally, we present a special graph class for which there is a polynomial-time algorithm. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011 © 2011 Wiley Periodicals, Inc.

Sebastian Stiller | Christina Büsing

[1] Martin Grötschel,et al. A Column-Generation Approach to Line Planning in Public Transport , 2007, Transp. Sci..

[2] P. Kreuzer,et al. Optimal lines for railway systems , 1997 .

[3] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[6] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .

[7] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[8] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.