Approximating the generalized minimum Manhattan network problem (Q1751089): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W155897563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-size ε-nets for axis-parallel rectangles and boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for NP-hard geometric optimization problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem / 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: Minimum Manhattan network is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rounding algorithm for approximating minimum Manhattan networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Generalized Minimum Manhattan Network Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum Manhattan networks in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for directed Steiner forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2968082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2748154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimal Manhattan Network Problem in Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-minimal trees in directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear Steiner arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Arborescence Problem Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 17:04, 15 July 2024

scientific article
Language Label Description Also known as
English
Approximating the generalized minimum Manhattan network problem
scientific article

    Statements

    Approximating the generalized minimum Manhattan network problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2018
    0 references
    0 references
    approximation algorithms
    0 references
    computational geometry
    0 references
    minimum Manhattan network
    0 references
    0 references