Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Strong-diameter decompositions of minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twice-ramanujan sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex sparsifiers with Steiner nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Lower Bound for the Steiner Point Removal Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Sparsifiers: New Results from Old Techniques / 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: An improved approximation algorithm for requirement cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Terminal Distances Using Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors, network decomposition, and multicommodity flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions and limits to vertex sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Lipschitz functions via random metric partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric extension operators, vertex sparsifiers and Lipschitz extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey partitions and proximity data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 15:22, 10 July 2024

scientific article; zbMATH DE number 6473198
Language Label Description Also known as
English
Cutting Corners Cheaply, or How to Remove Steiner Points
scientific article; zbMATH DE number 6473198

    Statements

    Cutting Corners Cheaply, or How to Remove Steiner Points (English)
    0 references
    18 August 2015
    0 references
    Steiner point removal
    0 references
    approximate distances
    0 references
    metric spaces
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references