A PTAS for the geometric connected facility location problem (Q2408564): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-017-9749-x / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-017-9749-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2584803184 / 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: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean prize-collecting Steiner forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Long Can a Euclidean Traveling Salesman Tour Be? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / 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: Approximation schemes for node-weighted geometric Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-017-9749-X / rank
 
Normal rank

Latest revision as of 11:07, 18 December 2024

scientific article
Language Label Description Also known as
English
A PTAS for the geometric connected facility location problem
scientific article

    Statements

    A PTAS for the geometric connected facility location problem (English)
    0 references
    12 October 2017
    0 references
    connected facility location problem
    0 references
    geometric problem
    0 references
    polynomial-time approximation scheme
    0 references
    prize-collecting
    0 references

    Identifiers