Abstract
We discuss extensions of Jain’s framework for network design [7] that go beyond undirected graphs. The main problem is approximating a minimum cost set of directed edges that covers a crossing supermodular function. We show that iterated rounding gives a factor 3 approximation, where factor 4 was previously known and factor 2 was conjectured. Our bound is tight for the simplest interpretation of iterated rounding. We also show that (the simplest version of) iterated rounding has unbounded approximation ratio when the problem is extended to mixed graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cheriyan, J., Vempala, S.: Edge covers of setpairs and the iterative rounding method. In: Proc. 8th International Integer Programming and Combinatorial Optimization Conf., pp. 30–44 (2001)
Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimumcost k-vertex connected subgraphs. In: Proc. 34th Annual ACM Symp. on Theory of Comput., pp. 306–312 (2002)
Frank, A.: Kernel systems of directed graphs. Acta Sci. Math., Szeged, Hungary 41, 63–76 (1979)
Frederickson, G.N., Ja’Ja’, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270–283 (1981)
Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, submitted; union of An iterative rounding 2-approximation algorithm for the element connectivity problem. In: Proc. 42nd Annual IEEE Symp. on Foundations of Comp. Sci., pp. 339–347 (2001); and A 2-approximation for minimum cost {0, 1, 2} vertex connectivity. In: Proc. 8th International Integer Programming and Combinatorial Optimization Conf., pp. 115–129 (2001)
Gabow, H.N.: On the L∞-norm of extreme points for crossing supermodular directed network LPs. Tech. Rept. CU-CS-991-05, Dept. of Computer Science, University of Colorado at Boulder (2005)
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 39–60 (2001)
Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM 41(2), 214–235 (1994)
Kortsarz, G., Nutov, Z.: Approximation algorithm for k-node connected subgraphs via critical graphs. In: Proc. 36th Annual ACM Symp. on Theory of Comput., pp. 138–145 (2004)
Melkonian, V., Tardos, E.: Algorithms for a network design problem with crossing supermodular demands. Networks 43(4), 256–265 (2004)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, NY (2003)
Vazirani, V.V.: Approximation Algorithms. Springer, NY (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabow, H.N. (2005). On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_29
Download citation
DOI: https://doi.org/10.1007/11496915_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)