A generalized approximation framework for fractional network flow and packing problems (Q684147): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A capacity scaling algorithm for the constrained maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential function methods for approximately solving linear programming problems: theory and practice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A double scaling algorithm for the constrained maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a capacity scaling algorithm for the constrained maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster polynomial algorithm for the constrained maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms For Linear Inequalities with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing membership in matroid polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and simple approximation schemes for generalized flow. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing algorithms for arborescences (and spanning trees) in capacitated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems / 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: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budget-constrained minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity and approximability of budget-constrained minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum flows in generalized processing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster approximation schemes for fractional multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Approximation Algorithms for Generalized Flow Problems / 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: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate parametric searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886046 / rank
 
Normal rank

Latest revision as of 02:25, 15 July 2024

scientific article
Language Label Description Also known as
English
A generalized approximation framework for fractional network flow and packing problems
scientific article

    Statements

    A generalized approximation framework for fractional network flow and packing problems (English)
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    approximation algorithms
    0 references
    fractional packing
    0 references
    network flows
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers