Pages that link to "Item:Q4268710"
From MaRDI portal
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.
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Cut equivalence of \(d\)-dimensional guillotine partitions (Q397169) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- The number of guillotine partitions in \(d\) dimensions (Q844186) (← links)
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Cooperative TSP (Q982655) (← links)
- Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Competitive on-line coverage of grid environments by a mobile robot (Q1869751) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension (Q2396378) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- Routing vehicles to minimize fuel consumption (Q2450732) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
