A Network Improvement Problem Under Different Norms

Computational Optimization and Applications

Volumn 27, Issue 3, 2004, Pages 305-319

  Zhang, J Z ^a   Yang, X G ^b   Cai, M C ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

Inapproximability; Location problem; Network improvement problems; Strongly polynomial algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

INAPPROXIMABILITY; LOCATION PROBLEMS; NETWORK IMPROVEMENT PROBLEMS; STRONGLY POLYNOMIAL ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 1342282230     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:COAP.0000013061.17529.79     Document Type: Article

References (6)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer: Berlin, 1999.
2. J.R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker, Inc., New York, 1992.
3. S.O. Krumke et al., "Approximation algorithms for certain network improvement problems," Journal of Combinatorial Optimization, vol. 2, pp. 257-288, 1998.
4. C.H. Papadimitriou, Computational Complexity, Addison-Wesley: Reading MA, 1994.
5. R. Raz and S. Safra, "A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP," in Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM, 1997, pp. 475-484.
6. J. Zhang, X. Yang, and M. Cai, "Reverse center location problem," in Algorithms and Computation, Lecture Notes in Computer Science 1741, A. Aggarwal and C.P. Rangan (Eds.), Springer: Berlin, 1999, pp. 279-294.