Network flow spanners (Q3057178): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners on chordal graphs: complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>(1 + εΒ)</i> -spanner constructions for general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On network design problems: fixed cost flows and the covering steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation algorithm for the survivable network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity approximations and graph carvings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of minimum spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank

Latest revision as of 12:59, 3 July 2024

scientific article
Language Label Description Also known as
English
Network flow spanners
scientific article

    Statements

    Network flow spanners (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    0 references
    network design
    0 references
    maximum flow preservation
    0 references
    spanners
    0 references
    spanning trees
    0 references
    approximation algorithms
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references