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

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 392-406

  Gabow, Harold N ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER NETWORKS; COSTS; FUNCTIONS; ITERATIVE METHODS; PROBLEM SOLVING; SET THEORY;

COST SET; ITERATED ROUNDING; NETWORK DESIGN; SUPERMODULAR FUNCTIONS;

GRAPH THEORY;

EID: 24944543838     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_29     Document Type: Conference Paper

References (13)

1. Cheriyan, J., Vempala, S.: Edge covers of setpairs and the iterative rounding method. Proc. 8th International Integer Programming and Combinatorial Optimization Conf. (2001) 30-44
2. Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimum-cost k-vertex connected subgraphs. Proc. 34th Annual ACM Symp. on Theory of Comput. (2002) 306-312
3. Frank, A.: Kernel systems of directed graphs. Acta Sci. Math., Szeged, Hungary 41 (1979) 63-76
4. Frederickson, G.N., Ja'Ja', J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10, 2 (1981) 270-283
5. 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, Proc. 42nd Annual IEEE Symp. on Foundations of Comp. Sci. (2001) 339-347,
6. and A 2-approximation for minimum cost {0, 1, 2} vertex connectivity, Proc. 8th International Integer Programming and Combinatorial Optimization Conf. (2001) 115-129
7. ∞-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.
8. Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21 (2001) 39-60
9. Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM 41, 2 (1994) 214-235
10. Kortsarz, G., Nutov, Z.: Approximation algorithm for k-node connected subgraphs via critical graphs. Proc. 36th Annual ACM Symp. on Theory of Comput. (2004) 138-145
11. Melkonian, V., Tardos, E.: Algorithms for a network design problem with crossing supermodular demands. Networks 43, 4 (2004) 256-265
12. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, NY (2003)
13. Vazirani, V.V: Approximation Algorithms. Springer-Verlag, NY (2001)