메뉴 건너뛰기




Volumn , Issue , 2007, Pages 338-348

On the optimality of planar and geometric approximation schemes

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; GEOMETRY; POLYNOMIAL APPROXIMATION;

EID: 46749156309     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389505     Document Type: Conference Paper
Times cited : (87)

References (28)
  • 1
    • 0001639796 scopus 로고    scopus 로고
    • Label placement by maximum independent set in rectangles
    • 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.
    • (1998) Comput. Geom , vol.11 , Issue.3-4 , pp. 209-218
    • Agarwal, P.K.1    van Kreveld, M.2    Suri, S.3
  • 2
    • 8344254038 scopus 로고    scopus 로고
    • Parameterized complexity: Exponential speed-up for planar graph problems
    • J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms, 52(1):26-56, 2004.
    • (2004) J. Algorithms , vol.52 , Issue.1 , pp. 26-56
    • Alber, J.1    Fernau, H.2    Niedermeier, R.3
  • 3
    • 3042812044 scopus 로고    scopus 로고
    • Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
    • 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.
    • (2004) J. Algorithms , vol.52 , Issue.2 , pp. 134-151
    • Alber, J.1    Fiala, J.2
  • 5
    • 0030413554 scopus 로고    scopus 로고
    • Polynomial time approximation schemes for Euclidean TSP and other geometric problems
    • IEEE Comput. Soc. Press
    • S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In FOCS 1996, pages 2-11. IEEE Comput. Soc. Press, 1996.
    • (1996) FOCS 1996 , pp. 2-11
    • Arora, S.1
  • 6
    • 0032156828 scopus 로고    scopus 로고
    • Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
    • S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998.
    • (1998) J. ACM , vol.45 , Issue.5 , pp. 753-782
    • Arora, S.1
  • 7
    • 0028255806 scopus 로고
    • Approximation algorithms for NP-complete problems on planar graphs
    • B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
    • (1994) J. ACM , vol.41 , Issue.1 , pp. 153-180
    • Baker, B.S.1
  • 8
    • 27144479400 scopus 로고
    • Schémas d'approximation et complexité paramétrée
    • Technical report, Université Paris Sud
    • C. Bazgan. Schémas d'approximation et complexité paramétrée. Technical report, Université Paris Sud, 1995.
    • (1995)
    • Bazgan, C.1
  • 9
    • 46749087360 scopus 로고    scopus 로고
    • L. Cai, M. Fellows, D. Juedes, and F. Rosamond. The complexity of polynomial-time approximation, 2006. To appear in Theory of Computing Systems.
    • L. Cai, M. Fellows, D. Juedes, and F. Rosamond. The complexity of polynomial-time approximation, 2006. To appear in Theory of Computing Systems.
  • 10
    • 0000177976 scopus 로고    scopus 로고
    • On the efficiency of polynomial time approximation schemes
    • M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Inform. Process. Lett., 64(4):165-171, 1997.
    • (1997) Inform. Process. Lett , vol.64 , Issue.4 , pp. 165-171
    • Cesati, M.1    Trevisan, L.2
  • 11
    • 4544225528 scopus 로고    scopus 로고
    • Linear FPT reductions and computational lower bounds
    • New York, ACM
    • J. Chen, X. Huang, I. A. Kanj, and G. Xia. Linear FPT reductions and computational lower bounds. In STOC 2004, pages 212-221, New York, 2004. ACM.
    • (2004) STOC 2004 , pp. 212-221
    • Chen, J.1    Huang, X.2    Kanj, I.A.3    Xia, G.4
  • 12
    • 33748103149 scopus 로고    scopus 로고
    • The PCP theorem by gap amplification
    • I. Dinur. The PCP theorem by gap amplification. In STOC 2006, pages 241-250, 2006.
    • (2006) STOC 2006 , pp. 241-250
    • Dinur, I.1
  • 14
    • 0029488567 scopus 로고
    • An approximation scheme for planar graph TSP
    • IEEE, Los Alamitos, CA
    • M. Grigni, E. Koutsoupias, and C. Papadimitriou. An approximation scheme for planar graph TSP. In FOCS 1995, pages 640-645. IEEE, Los Alamitos, CA, 1995.
    • (1995) FOCS 1995 , pp. 640-645
    • Grigni, M.1    Koutsoupias, E.2    Papadimitriou, C.3
  • 16
    • 0035734883 scopus 로고    scopus 로고
    • Which problems have strongly exponential complexity?
    • R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? J. Comput. System Sci., 63(4):512-530, 2001.
    • (2001) J. Comput. System Sci , vol.63 , Issue.4 , pp. 512-530
    • Impagliazzo, R.1    Paturi, R.2    Zane, F.3
  • 17
    • 0029712046 scopus 로고    scopus 로고
    • Towards a syntactic characterization of PTAS
    • S. Khanna and R. Motwani. Towards a syntactic characterization of PTAS. In STOC 1996, pages 329-337.
    • STOC 1996 , pp. 329-337
    • Khanna, S.1    Motwani, R.2
  • 18
    • 0035705867 scopus 로고    scopus 로고
    • The approximability of constraint satisfaction problems
    • S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM J. Comput., 30(6):1863-1920, 2001.
    • (2001) SIAM J. Comput , vol.30 , Issue.6 , pp. 1863-1920
    • Khanna, S.1    Sudan, M.2    Trevisan, L.3    Williamson, D.P.4
  • 19
    • 33748123393 scopus 로고    scopus 로고
    • A linear-time approximation scheme for planar weighted TSP
    • IEEE
    • P. Klein. A linear-time approximation scheme for planar weighted TSP. In FOCS 2005, pages 647-656. IEEE, 2005.
    • (2005) FOCS 2005 , pp. 647-656
    • Klein, P.1
  • 20
    • 0018457301 scopus 로고
    • A separator theorem for planar graphs
    • R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177-189, 1979.
    • (1979) SIAM J. Appl. Math , vol.36 , Issue.2 , pp. 177-189
    • Lipton, R.J.1    Tarjan, R.E.2
  • 21
    • 0001029324 scopus 로고
    • Applications of a planar separator theorem
    • R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM J. Comput., 9(3):615-627, 1980.
    • (1980) SIAM J. Comput , vol.9 , Issue.3 , pp. 615-627
    • Lipton, R.J.1    Tarjan, R.E.2
  • 23
    • 33748627170 scopus 로고    scopus 로고
    • The closest substring problem with small distances
    • D. Marx. The closest substring problem with small distances. In FOCS 2005, pages 63-72, 2005.
    • (2005) FOCS 2005 , pp. 63-72
    • Marx, D.1
  • 24
    • 27144543195 scopus 로고    scopus 로고
    • Efficient approximation schemes for geometric problems?
    • D. Marx. Efficient approximation schemes for geometric problems? In ESA 2005, pages 448-459, 2005.
    • (2005) ESA 2005 , pp. 448-459
    • Marx, D.1
  • 25
    • 46749090362 scopus 로고    scopus 로고
    • D. Marx. Parameterized complexity and approximation algorithms, 2006. To appear in The Computer Journal.
    • D. Marx. Parameterized complexity and approximation algorithms, 2006. To appear in The Computer Journal.
  • 26
    • 0031634765 scopus 로고    scopus 로고
    • Approximating geometrical graphs via "spanners" and "banyans
    • ACM, New York
    • S. B. Rao and W. D. Smith. Approximating geometrical graphs via "spanners" and "banyans". In STOC '98 (Dallas, TX), pages 540-550. ACM, New York, 1999.
    • (1999) STOC '98 (Dallas, TX) , pp. 540-550
    • Rao, S.B.1    Smith, W.D.2
  • 27
    • 33746464501 scopus 로고    scopus 로고
    • Better approximation schemes for disk graphs
    • E. J. van Leeuwen. Better approximation schemes for disk graphs. In SWAT 2006, pages 316-327, 2006.
    • (2006) SWAT 2006 , pp. 316-327
    • van Leeuwen, E.J.1
  • 28
    • 0024065502 scopus 로고
    • A study on two geometric location problems
    • D. W. Wang and Y-S. Kuo. A study on two geometric location problems. Inform. Process. Lett., 28(6):281-286, 1988.
    • (1988) Inform. Process. Lett , vol.28 , Issue.6 , pp. 281-286
    • Wang, D.W.1    Kuo, Y.-S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.