The Shortest Separating Cycle Problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Workshop on Approximation and Online Algorithms

• Publication date

  2016-08-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-51741-4_1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Reducing Curse of Dimensionality

  2016cited by this paper
• A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane

  2010cited by this paper
• A PTAS for TSP with neighborhoods among fat regions in the plane

  2007cited by this paper
• Double Rulings for Information Brokerage in Sensor Networks

  2006cited by this paper
• Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems

  2004cited by this paper
• On the complexity of approximating tsp with neighborhoods and related problems

  2003cited by this paper
• GHT: a geographic hash table for data-centric storage

  2002cited by this paper
• Approximation algorithms for TSP with neighborhoods in the plane

  2001cited by this paper
• Hardness Result for TSP with Neighborhoods

  2000cited by this paper
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

  1999cited by this paper
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

  1998cited by this paper
• The Errand Scheduling Problem

  1997cited by this paper
• Approximation algorithms for geometric tour and network design problems (extended abstract)

  1995cited by this paper
• Approximation Algorithms for the Geometric Covering Salesman Problem

  1994cited by this paper
• How Long can a Euclidean Traveling Salesman Tour Be?

  1989cited by this paper
• The Euclidean Traveling Salesman Problem is NP-Complete

  1977influential reference
• Some NP-complete geometric problems

  1976influential reference

• Separating Bichromatic Polylines by Fixed-angle Minimal Triangles

  2022cites this paper
• Separating bichromatic polylines by (cid:12)xed-angle minimal triangles

  2022cites this paper
• On the Shortest Separating Cycle

  2019influential citation
• Stabbing segments with rectilinear objects

  2015cites this paper