On the L∞-norm of extreme points for crossing supermodular directed network LPs

Mathematical Programming

Volumn 110, Issue 1, 2007, Pages 111-144

  Gabow, Harold N ^a  

^a University of Colorado at Boulder   (United States)

Author keywords

Approximation algorithms; Basic feasible solution; Crossing supermodular function; Directed networks; Extreme point; Iterated rounding; L norm; Linear programming; Network design

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; FUNCTION EVALUATION; ITERATIVE METHODS; PROBLEM SOLVING;

BASIC FEASIBLE SOLUTION; CROSSING SUPERMODULAR FUNCTION; DIRECTED NETWORKS; EXTREME POINT; ITERATED ROUNDING; NETWORK DESIGN;

LINEAR PROGRAMMING;

EID: 33947128777     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0061-9     Document Type: Article

References (14)

1. 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)
2. Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimum-cost k-vertex connected subgraphs. In:Proc. 34th Annual ACM Symp. on Theory of Comput., pp. 306-312 (2002)
3. Frank, A.: Kernel systems of directed graphs. Acta Sci. Math., Szeged, Hungary 41, 63-76 (1979)
4. Frank, A.: Submodular functions in graph theory. Discrete Math. 111, 231-243 (1993)
5. Frederickson, G.N., Ja'Ja', J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10, 270-283 (1981)
6. Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, submitted for publication; 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);
7. 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)
8. Gabow, H.N., Goemans, M. X., Tardos, E., Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. In: Proc. 16th Annual ACM-SIAM Symp. on Disc. Algorithms, pp. 562-571 (2005)
9. Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 39-60 (2001)
10. Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM 41, 214-235 (1994)
11. 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)
12. Melkonian, V., Tardos, E.: Algorithms for a network design problem with crossing supermodular demands. Networks 43, 256-265 (2004)
13. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin Heidelberg New York (2003)
14. Vazirani, V.V.: Approximation Algorithms. Springer, Berlin Heidelberg New York (2001)