Computing nonsimple polygons of minimum perimeter
Metadata only
Date
2016Type
- Conference Paper
Publication status
publishedExternal links
Editor
Book title
Experimental Algorithms: 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, ProceedingsJournal / series
Lecture Notes in Computer ScienceVolume
Pages / Article No.
Publisher
SpringerEvent
Subject
Traveling Salesman Problem (TSP); Minimum Perimeter Polygon (MPP); Curve reconstruction; NP-hardness; Exact optimization; Integer programming; Computational geometry meets combinatorial OptimizationOrganisational unit
03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus)
More
Show all metadata