Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Leonid G. Khachiyan / rank
Normal rank
 
Property / author
 
Property / author: Leonid G. Khachiyan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination Complexity of Parallel Price-Directive Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A natural randomization strategy for multicommodity flow and related algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215386 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 18:07, 27 May 2024

scientific article
Language Label Description Also known as
English
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
scientific article

    Statements

    Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (English)
    0 references
    0 references
    11 November 1997
    0 references
    0 references
    block-angular program
    0 references
    budget-constrained network flow
    0 references
    structured optimization
    0 references
    \(\varepsilon\)-approximate solution
    0 references
    cost-constrained \(K\)-commodity flow problem
    0 references
    approximate minimum-cost multicommodity flow
    0 references