Pages that link to "Item:Q4268710"

The following pages link to Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems (Q4268710):

Displaying 50 items.

• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
• The traveling salesman theorem for Jordan curves (Q2671903) (← links)
• Rectangular partitions of a rectilinear polygon (Q2678268) (← links)
• Approximation Algorithms for Cumulative VRP with Stochastic Demands (Q2795944) (← links)
• Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
• A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
• The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
• An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← links)
• The Shortest Separating Cycle Problem (Q2971152) (← links)
• Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
• Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
• PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k (Q3069731) (← links)
• Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
• (Q3191144) (← links)
• APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
• Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
• An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
• Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
• APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
• Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
• The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
• Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
• APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING (Q4682171) (← links)
• BALANCED PARTITION OF MINIMUM SPANNING TREES (Q4818586) (← links)
• TRAVELING SALESMAN PROBLEM OF SEGMENTS (Q4818594) (← links)
• Multi-level Steiner Trees (Q4984869) (← links)
• (Q5020990) (← links)
• Network optimization on partitioned pairs of points (Q5136221) (← links)
• Multi-Level Steiner Trees. (Q5140725) (← links)
• A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
• APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (Q5168426) (← links)
• Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
• Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
• HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES (Q5297794) (← links)
• A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
• Travelling on graphs with small highway dimension (Q5925522) (← links)
• Polygons cuttable by a circular saw (Q5952972) (← links)
• Maximum bipartite matchings with low rank data: locality and perturbation analysis (Q5964024) (← links)
• Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
• The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem (Q6115413) (← links)
• An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
• Time complexity of the analyst's traveling salesman algorithm (Q6200929) (← links)
• Euclidean TSP in narrow strips (Q6541986) (← links)
• Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)
• Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971) (← links)
• An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem (Q6606207) (← links)
• On a traveling salesman problem for points in the unit cube (Q6614116) (← links)