On fixed cost \(k\)-flow problems (Q260248): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mohammad Taghi Hajiaghayi / rank
Normal rank
 
Property / author
 
Property / author: Mohammad Taghi Hajiaghayi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-014-9572-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078521722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized submodular cover problems and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polymatroid Steiner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design on Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation algorithm for the group Steiner problem / 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: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum shift design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828915 / rank
 
Normal rank

Latest revision as of 16:15, 11 July 2024

scientific article
Language Label Description Also known as
English
On fixed cost \(k\)-flow problems
scientific article

    Statements

    On fixed cost \(k\)-flow problems (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed cost flow
    0 references
    group Steiner tree
    0 references
    network design
    0 references
    approximation algorithms
    0 references
    0 references