Skip to main content
SpringerLink
Log in

Traveling Sales Person with Few Inner Points

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 56 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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Děneko VG, Hoffmann M, Okamoto Y, Woeginger GJ (2006) The traveling salesman problem with few inner points. Oper Res Lett 31:106–110

    Article  MathSciNet  MATH  Google Scholar 

  2. Downey RG, Fellows MR (1999) Parameterized complexity. Monographs in computer science. Springer, New York

    Book  Google Scholar 

  3. Flum J, Grohe M (2006) Parameterized complexity theory. Texts in theoretical computer science an EATCS series. Springer, Berlin

    Google Scholar 

  4. Garey MR, Graham RL, Johnson DS (1976) Some NP-complete geometric problems. In: Proceedings of 8th annual ACM symposium on theory of computing (STOC '76). Association for Computing Machinery, New York, pp 10–22

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. Grantson M, Borgelt C, Levcopoulos C (2005) 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. Springer, New York, pp 984–994

    Google Scholar 

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

    Google Scholar 

  9. Grantson M, Levcopoulos C (2005) 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. Springer, New York, pp 83–94

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  13. Knauer C, Spillner A (2006) 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. Springer, New York, pp 49–57

    Google Scholar 

  14. Lawler E, Lenstra J, Rinnooy Kan A, Shmoys D (eds) (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester

    MATH  Google Scholar 

  15. Mulzer W, Rote G (2006) Minimum weight triangulation is NP-hard. In: Proceedings of the 22nd annual ACM symposium on computational geometry (SoCG). Association for Computing Machinery, New York, pp 1–10

    Google Scholar 

  16. Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford lecture series in mathematics and its applications, vol 31. Oxford University Press, Oxford

    Book  Google Scholar 

  17. Papadimitriou CH (1977) The Euclidean travelling salesman problem is NP-complete. Theor Comput Sci 4:237–244

    Article  MathSciNet  MATH  Google Scholar 

  18. Spillner A (2005) 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. King's College, London, pp 135–146

    Google Scholar 

  19. Spillner A (2005) Optimal convex partitions of point sets with few inner points. In: Proceedings of the 17th Canadian conference on computational geometry (CCCG), 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

Corresponding author

Correspondence to Yoshio Okamoto .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Okamoto, Y. (2016). Traveling Sales Person with Few Inner Points. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_426

Download citation

Publish with us

Policies and ethics

Search

Navigation