Connections in networks: Hardness of feasibility versus optimality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4510 LNCS, Issue , 2007, Pages 16-28

  Conrad, Jon ^a   Gomes, Carla P ^a   Van Hoeve, Willem Jan ^a   Sabharwal, Ashish ^a   Suter, Jordan ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

SOCIAL NETWORKS; SUBGRAPH PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 37149033824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72397-4_2     Document Type: Conference Paper

References (10)

1. A. Ando, J. Camm, S. Polasky, and A. Solow. Special distributions, land values, and efficient conservation. Science, 279(5359):2126-2128, 1998.
2. M. W. Bern and P. E. Plassmann. The Steiner tree problem with edge lengths 1 and 2. Information Processing Letters, 32(4):171-176, 1989.
3. J. D. Camm, S. K. Norman, S. Polasky, and A. R. Solow. Nature reserve site selection to maximize expected species covered. Operations Research, 50(6) :946-955, 2002.
4. I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162(1) :439-486, 2005.
5. C. Faloutsos, K. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 118-127. ACM Press, 2004.
6. I. Gent and T. Walsh. The TSP Phase Transition. Artificial Intelligence, 88(1-2): 349-358, 1996.
7. ILOG, SA. CPLEX 10.1 Reference Manual, 2006.
8. H. J. Prömel and A. Steger. The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity. Vieweg, 2002.
9. D. Simberloff, J. Farr, J. Cox, and D. Mehlman. Movement corridors: Conservation bargains or poor invesments? Conservation Biology, 6:493-504, 1997.
10. W. Zhang and R. Korf. A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem. Artificial Intelligence, 81:223-239, 1996.