Pages that link to "Item:Q3158519"

The following pages link to Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519):

Displaying 50 items.

• PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
• Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
• Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
• Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
• Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
• Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
• On approximating string selection problems with outliers (Q391209) (← links)
• On the approximability of dense Steiner problems (Q396661) (← links)
• Exponential approximation schemata for some network design problems (Q396669) (← links)
• The traveling salesman problem with flexible coloring (Q444446) (← links)
• Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
• Shifting strategy for geometric graphs without geometry (Q454249) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
• Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← links)
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
• Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
• Steiner trees with bounded RC-delay (Q527413) (← links)
• Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
• Approximating the metric TSP in linear time (Q649110) (← links)
• Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
• Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
• On the total perimeter of homothetic convex bodies in a convex container (Q747571) (← links)
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
• Budget constrained minimum cost connected medians (Q876728) (← 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)
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
• Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
• Cooperative TSP (Q982655) (← links)
• Region-restricted clustering for geographic data mining (Q1000925) (← links)
• Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← 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)
• A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
• The Steiner ratio of high-dimensional Banach--Minkowski spaces. (Q1428549) (← links)
• Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
• Bottleneck bichromatic full Steiner trees (Q1628678) (← links)