NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 238-274

  Hunt III, Harry B ^a   Marathe, Madhav V ^b   Radhakrishnan, Venkatesh ^c   Ravi, S S ^a   Rosenkrantz, Daniel J ^a   Stearns, Richard E ^a  

^a State University of New York   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

Approximation schemes; Geometric graphs; Graphs drawn in a civilized manner; Hierarchical specifications; Parallel algorithms; Unit disk graphs; VLSI design

Indexed keywords

EID: 0000091588     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0903     Document Type: Article

References (51)

1. S. R. Arikati, A. Dessmark, A. Lingas, and M. V. Marathe, Approximation algorithms for maximum two-dimensional pattern matching, in "Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM), Laguna Beach, CA, June 1996," Lecture Notes in Computer Science, Vol. 1075, pp. 348-360, Springer-Verlag, Berlin/New York. (A complete version of the paper appears as Technical Report LA-UR-96-1375, Los Alamos National Laboratory, 1996.)
2. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340.
3. S. Arnborg and A. Proskurowski, Linear-time algorithms for NP-hard problems on graphs embedded in k-trees, Discrete Appl. Math. 23 (1989), 11-24.
4. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach. 41(1) (1994), 153-180.
5. H. Breu and D. Kirkpatrick, "Unit Disk Graph Recognition is NP-hard," Technical Report 93-27, Department of Computer Science, University of British Columbia, August, 1993.
6. H. L. Bodlaender, Dynamic programming on graphs of bounded treewidth, in Proc. 15th International Colloquium on Automata Languages and Programming (ICALP)," Lecture Notesin Computer Science, Vol. 317, pp. 105-118, Springer, Verlag, Berlin/New York, 1988.
7. J. L. Bentley, T. Ottmann, and P. Widmayer, The complexity of manipulating hierarchically defined sets of rectangles, in Advances in Computing Research (F. P. Preparata, Ed.), Vol. 1, pp. 127-158, JAI Press, Greenwich, CT, 1983.
8. B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990), 165-177.
9. A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions, Chicago J. Theoret. Comput. Sci. 1995(4) (http://www.cs.uchicago.edu/publications/cjtcs/articl es/1995/4/contentshtml).
10. A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Random debaters and the hardness of approximating stochastic functions, SIAM J. Comput. 26(2) (1997), 369-400.
11. P. Crescenzi and V. Kann, A compendium of NP-optimization problems, preliminary version, March 1997.
12. T. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1991.
13. S. Doddi, M. V. Marathe, A. Mirzaian, B. Moret, and B. Zhu, Map labeling problems, in "Proc. 8th ACM-SIAM Symposium on Discrete Algorithms(SODA), 1997, pp. 148-157.
14. P. G. Doyle and J. L. Snell, "Random Walksand Electric Networks," The Carus Mathematical Monographs, Math. Assoc. of America, Washington, DC, 1984.
15. J. Diaz, M. J. Serna, and J. Toran, Parallel approximation schemes for problems on planar graphs, Acta Inform. 33(4) (1996), 387-408.
16. D. Eppstein, G. L. Miller, and S. H. Teng, A deterministic linear time algorithm for geometric separators and its application, in "Proc. 9th ACM Symposium on Computational Geometry, 1993," pp. 99-108.
17. D. Eppstein, Subgraph isomorphism in planar graphs and related problems, in "Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995," pp. 632-640.
18. T. Feder and D. Greene, Optimal algorithms for approximate clustering, in "30th ACM Symposium on Theory of Computing (STOC), 1988," pp. 434-444.
19. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett. 12(3) (1981), 133-137.
20. M. R. Garey and D. S. Johnson, "Computersand Intractability: A Guide to the Theory of NP-completeness," Freeman, San Francisco, CA, 1979.
21. A. Gräf, M. Stumpf, and G. Weisenfels, On coloring unit disk graphs, unpublished manuscript, July 1994.
22. M. X. Goemansand D. P. Williamson, .878 Approximation Algorithmsfor MAX CUT and MAX 2SAT, in "Proc. 26th Annual ACM Symposium on Theory of Computing (STOC), May 1994," pp. 422-431.
23. W. K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (1980), 1497-1514.
24. D. S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, J. Assoc. Comput. Mach. 32(1) (1985), 130-136.
25. D. S. Hochbaum and W. Maass, Fast approximation algorithms for a nonconvex covering problem, J. Algorithms 8 (1987), 305-323.
26. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns, Designing approximation schemes using L-reductions, in "Proceedings of 14th Foundations of Software Technology and Theoretical Computer Science (FST & TCS)," Lecture Notes in Computer Science, Vol. 761, pp. 342-353, Springer-Verlag, Berlin/New York, 1994. (A complete version of the paper, titled "Parallel Approximation Schemes for Planar and Near-Planar Satisfiability and Graph Problems," is available as Technical Report LA-UR-96-2723, Los Alamos National Laboratory, 1996.)
27. J. Jiang and L. Wang, An approximation scheme for some Steiner tree problems in the plane, in "International Symposium on Algorithms and Computation (ISAAC), 1994."
28. K. Kammerlander, C 900-an advanced mobile radio telephone system with optimum frequency utilization, IEEE Trans. Selected Areas in Communication 2 (1984), 589-597.
29. S. Khanna and R. Motwani, Towards a syntactic characterization of PTAS, in "Proc. 28th Annual ACM Symposium on Theory of Computing, (STOC), 1996," pp. 329-337.
30. P. N. Klein and S. Sairam, An efficient parallel algorithm for shortest paths in planar graphs, in "Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS), 1993," pp. 259-270.
31. R. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 32(2), (1979), 177-189.
32. T. Lengauer and E. Wanke, Efficient solutions for connectivity problems for hierarchically defined graphs, SIAM J. Comput. 17(6) (1988), 1063-1080.
33. T. Lengauer and K. W. Wagner, The correlation between the complexities of nonhierarchical and hierarchical versions of graph problems, J. Comput. System Sci. 44(1992), 63-93.
34. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995), 59-68.
35. C. A. Mead and L. Conway, "Introduction to VLSI Systems," Addison-Wesley, Reading, MA, 1980.
36. M. V. Marathe, H. B. Hunt III, and R. E. Stearns, "Level Treewidth Property: Exact Algorithmsand Approximation Schemes," Technical Report LA-UR-97-479, Los Alamos National Laboratory, Jan. 1997.
37. M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan, Approximation schemes for PSPACE-complete problems for succinct graphs, in "Proceedings of 26th Annual ACM Symposium on the Theory of Computing (STOC), May 1994," pp. 468-477. (A complete version of the paper, entitles "Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems," will appear in SIAM J. Comput., 1998.)
38. M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan, Approximation schemes for PSPACE-complete problems for succinct graphs, in "Proceedings of 26th Annual ACM Symposium on the Theory of Computing (STOC), May 1994," pp. 468-477. (A complete version of the paper, entitles "Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems," will appear in SIAM J. Comput., 1998.)
39. M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan, "Complexity of Hierarchically and 1-Dimensional Periodically Specified Problems," Technical Report LA-U R-95-3348, Los Alamos National Laboratory, August 1995. (To appear in "Proc. DIMACS Workshop on Satisfiability Problem: Theory and Applications," Amer. Math. Soc., Providence, 1997.)
40. M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan, "Complexity of Hierarchically and 1-Dimensional Periodically Specified Problems," Technical Report LA-U R-95-3348, Los Alamos National Laboratory, August 1995. (To appear in "Proc. DIMACS Workshop on Satisfiability Problem: Theory and Applications," Amer. Math. Soc., Providence, 1997.)
41. M. V. Marathe, H. B. Hunt III, and S. S. Ravi, The complexity of approximating PSPACE-complete problems for hierarchical specifications, Nordic J. Comput. 1 (1994), 275-316.
42. M. V. Marathe, V. Radhakrishnan, H. B. Hunt III, and S. S. Ravi, Hierarchically specified unit disk graphs, Theoret. Comput. Sci. 174(1-2) (1997), 23-65.
43. N. Meggido and K. Supowit, On the complexity of some common geometric location problems, SIAM J. Comput. 13(1) (1984), 182-196.
44. G. L. Miller, S. H. Teng, W. Thurston, and S. A. Vavasis, Separators for sphere packings and nearest neighbor graphs, J. Assoc. Comput. Mach. 44(1) (1997), 1-29.
45. R. Peeters, "On Coloring j-unit Sphere Graphs," FEW 512, Department of Economics, Tilburg University NL, 1991.
46. J. Reif, Ed., "Synthesis of Parallel Algorithms," Morgan Kaufmann, San Mateo, CA, 1993.
47. S. H. Teng, "Points, Spheres, and Separators, A Unified Geometric Approach to Graph Separators," Ph.D. thesis, School of Computer Science, Carnegie Mellon Universty, CMU-CS-91-184, August 1991.
48. W. P. Thurston, "The Geometry and Topology of 3-manifolds," Princeton University Notes, 1988.
49. S. A. Vavasis, Automatic domain partitioning in three dimensions, SIAM J. Sci. Statist. Comput., 1991.
50. Y. Yeh, J. Wilson, and S. C. Schwartz, Outage probability in mobile telephony with directive antennas and macrodiversity, IEEE Trans. Selected Areas in Communication 2 (1984), 507-511.
51. D. W. Wongand Y. S. Kuo, A study of two geometric location problems, Inform. Process. Lett. 28(6) (1988), 281-286.