Efficient approximation schemes for geometric problems?

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 448-459

  Marx, Daniel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

DISK GRAPHS; GEOMETRIC PROBLEMS; INTERSECTION GRAPHS; PARAMETERIZED GRAPHS;

APPROXIMATION THEORY;

EID: 27144543195     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_41     Document Type: Conference Paper

References (14)

1. P. K. Agarwal, M. van Kreveld, and S. Suri. Label placement by maximum independent set in rectangles. Comput. Geom., 11(3-4):209-218, 1998.
2. J. Alber and J. Fiala. Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms, 52(2):134-151, 2004.
3. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In FOCS 1996, pages 2-11. IEEE Comput. Soc. Press, 1996.
4. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998.
5. C. Bazgan. Schémas d'approximation et complexité paramétrée. Technical report, Université Paris Sud, 1995.
6. M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Inform. Process. Lett., 64(4):165-171, 1997.
7. R. G. Downey. Parameterized complexity for the skeptic. In Proceedings of the 18th IEEE Annual Conference on Computational Complexity, pages 147-169, 2003.
8. R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in Computer Science. Springer-Verlag, New York, 1999.
9. T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In SODA 2001, pages 671-679. SIAM, 2001.
10. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32(1):130-136, 1985.
11. H. B. Hunt, III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms, 26(2):238-274, 1998.
12. E. Malesińska. Graph-Thoretical Models for Frequency Assignment Problems. PhD thesis, Technical University of Berlin, 1997.
13. L. Sunil Chandran and F. Grandoni. Refined memorization for vertex cover. Inform. Process. Lett., 93(3):125-131, 2005.
14. D. W. Wang and Y.-S. Kuo. A study on two geometric location problems. Inform. Process. Lett., 28(6):281-286, 1988.