Multi-priority graph sparsification (Q6182885): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4379117687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Amplification for Pairwise Spanner Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 4/3 Additive Spanner Exponent Is Tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Level Steiner Trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On additive spanners in weighted graphs with local error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners: a tutorial review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and (α, β)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Linear Size Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Light Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of some network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6083385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the quality of service multicast tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New pairwise spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subset spanner for Planar graphs, with application to subset TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Spanners: A Simple Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for subset TSP in minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating subset \(k\)-connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for priority Steiner tree problems / rank
 
Normal rank

Latest revision as of 08:20, 22 August 2024

scientific article; zbMATH DE number 7781720
Language Label Description Also known as
English
Multi-priority graph sparsification
scientific article; zbMATH DE number 7781720

    Statements

    Multi-priority graph sparsification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2023
    0 references
    graph spanners
    0 references
    sparsification
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers