Constant-Factor Approximation for TSP with Disks (Q4604382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Near-linear approximation algorithms for geometric hitting sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP with neighborhoods of varying size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum corridor connection problem and other generalized geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total perimeter of homothetic convex bodies in a convex container / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem for Lines, Balls, and Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets when the VC-dimension is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Violator spaces: Structure and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Traveling Salesman Tours through Stochastic Neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating TSP with neighborhoods and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon nets and union complexity / rank
 
Normal rank

Latest revision as of 05:06, 15 July 2024

scientific article; zbMATH DE number 6843452
Language Label Description Also known as
English
Constant-Factor Approximation for TSP with Disks
scientific article; zbMATH DE number 6843452

    Statements

    Constant-Factor Approximation for TSP with Disks (English)
    0 references
    0 references
    0 references
    26 February 2018
    0 references
    constant-ratio approximation
    0 references
    \(O(1)\)-approximation
    0 references
    minimum weight hitting set problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers