Computing nonsimple polygons of minimum perimeter

Thumbnail
Metadata only
Author
Fekete, Sándor P.
Haas, Andreas
Hemmer, Michael
Hoffmann, Michael
Kostitsyna, Irina
Krupke, Dominik
Maurer, Florian
Mitchell, Joseph S.B.
Schmidt, Arne
Schmidt, Christiane W.
Troegel, Julian
Show all
Date
2016
Type
  • Conference Paper
Publication status
published
External links
Search via SFX
Editor
Goldberg, Andrew V.
Kulikov, Alexander S.
Book title
Experimental Algorithms: 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings
Journal / series
Lecture Notes in Computer Science
Volume
9685
Pages
134 - 149
Publisher
Springer
Event
15th International Symposium on Experimental Algorithms, SEA 2016, St. Petersburg, Russia, June 5-8, 2016
Subject
Traveling Salesman Problem (TSP); Minimum Perimeter Polygon (MPP); Curve reconstruction; NP-hardness; Exact optimization; Integer programming; Computational geometry meets combinatorial Optimization
Organisational unit
03457 - Welzl, Emo
Notes
.
More
Show all metadata
Citations
Cited 0 times in Web of Science
Altmetrics