Approximability of Capacitated Network Design (Q3009752): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimum-Cost Network Design with (Dis)economies of Scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of capacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / 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: Q4856179 / 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: A Parallel Repetition Theorem / rank
 
Normal rank

Latest revision as of 05:43, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximability of Capacitated Network Design
scientific article

    Statements

    Approximability of Capacitated Network Design (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2011
    0 references

    Identifiers

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