Skip to main content
SpringerLink
Log in

Traveling Sales Person with Few Inner Points

2004; Deĭneko, Hoffmann, Okamoto, Woeginger

  • Reference work entry
Book cover Encyclopedia of Algorithms

  • 164 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Deĭneko, V.G., Hoffmann, M., Okamoto, Y., Woeginger, G.J.: The traveling salesman problem with few inner points. Oper. Res. Lett. 31, 106–110 (2006)

    Google Scholar 

  2. Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science. Springer, New York (1999)

    Google Scholar 

  3. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin (2006)

    Google Scholar 

  4. Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of 8th Annual ACM Symposium on Theory of Computing (STOC '76), pp. 10–22. Association for Computing Machinery, New York (1976)

    Chapter  Google Scholar 

  5. Grantson, M.: Fixed‐parameter algorithms and other results for optimal partitions. Lecentiate Thesis, Department of Computer Science, Lund University (2004)

    Google Scholar 

  6. Grantson, M., Borgelt, C., Levcopoulos, C.: A fixed parameter algorithm for minimum weight triangulation: Analysis and experiments. Tech. Rep. 154, Department of Computer Science, Lund University (2005)

    Google Scholar 

  7. Grantson, M., Borgelt, C., Levcopoulos, C.: Minimum weight triangulation by cutting out triangles. In: Deng, X., Du, D.-Z. (eds.) Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 3827, pp. 984–994. Springer, New York (2005)

    Google Scholar 

  8. Grantson, M., Borgelt, C., Levcopoulos, C.: Fixed parameter algorithms for the minimum weight triangulation problem. Tech. Rep. 158, Department of Computer Science, Lund University (2006)

    Google Scholar 

  9. Grantson, M., Levcopoulos, C.: A fixed parameter algorithm for the minimum number convex partition problem. In: Akiyama, J., Kano, M., Tan, X. (eds.) Proceedings of Japanese Conference on Discrete and Computational Geometry (JCDCG 2004). Lecture Notes in Computer Science, vol. 3742, pp. 83–94. Springer, New York (2005)

    Google Scholar 

  10. Hoffmann, M., Okamoto, Y.: The minimum weight triangulation problem with few inner points. Comput. Geom. Theory Appl. 34, 149–158 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT 33, 580–595 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Knauer, C., Spillner, A.: Fixed‐parameter algorithms for finding crossing‐free spanning trees in geometric graphs. Tech. Rep. 06–07, Department of Computer Science, Friedrich‐Schiller‐Universität Jena (2006)

    Google Scholar 

  13. Knauer, C., Spillner, A.: A fixed‐parameter algorithm for the minimum weight triangulation problem based on small graph separators. In: Proceedings of the 32nd International Workshop on Graph‐Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 4271, pp. 49–57. Springer, New York (2006)

    Google Scholar 

  14. Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys, D. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)

    MATH  Google Scholar 

  15. Mulzer, W., Rote, G.: Minimum Weight Triangulation is NP-hard. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SoCG), Association for Computing Machinery, New York 2006, pp. 1–10

    Google Scholar 

  16. Niedermeier, R.: Invitation to Fixed‐Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)

    Book  Google Scholar 

  17. Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP‑complete. Theor. Comput. Sci. 4, 237–244 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  18. Spillner, A.: A faster algorithm for the minimum weight triangulation problem with few inner points. In: Broersma, H., Johnson, H., Szeider, S. (eds.) Proceedings of the 1st ACiD Workshop. Texts in Algorithmics, vol. 4, pp. 135–146. King's College, London (2005)

    Google Scholar 

  19. Spillner, A.: Optimal convex partitions of point sets with few inner points. In: Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG), 2005, pp. 34–37

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Japan

    Yoshio Okamoto

Authors
  1. Yoshio Okamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Okamoto, Y. (2008). Traveling Sales Person with Few Inner Points. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_426

Download citation

Publish with us

Policies and ethics

Search

Navigation