Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Locating Sources to Meet Flow Demands in Undirected Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / 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: The source location problem with local 3-vertex-connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost source location problem with local 3-vertex-connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source location problems considering vertex-connectivity and edge-connectivity simultaneously / 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: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost source location problem with vertex-connectivity requirements in digraphs / 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: Minimizing a monotone concave function with laminar covering constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost source location problems with flow requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum bounded degree spanning trees to within one of optimal / rank
 
Normal rank

Latest revision as of 06:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
scientific article

    Statements

    Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (English)
    0 references
    0 references
    1 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references