A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-011-9337-9 / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
Normal rank
 
Property / author
 
Property / author: Khaled M. Elbassioni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-011-9337-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3138698442 / 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: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plongements lipschitziens dans ${\bbfR}\sp n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest neighbor queries in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP with neighborhoods of varying size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / 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: Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of nets in low dimensional metrics, and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The black-box complexity of nearest-neighbor search / 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: 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: 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: Bypassing the embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the free space for motion planning amidst fat obstacles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-011-9337-9 / rank
 
Normal rank

Latest revision as of 23:48, 9 December 2024

scientific article
Language Label Description Also known as
English
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
scientific article

    Statements

    A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (English)
    0 references
    0 references
    0 references
    25 November 2011
    0 references
    traveling salesman problem with neighborhoods
    0 references
    quasi-polynomial time approximation scheme
    0 references
    doubling metrics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers