A generalized approximation framework for fractional network flow and packing problems (Q684147)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

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

Statements

scholarly article

A generalized approximation framework for fractional network flow and packing problems (English)

Michael Holzhauser

Mathematical Methods of Operations Research

publication date

9 February 2018

full work available at URL

https://arxiv.org/abs/1612.05474

zbMATH Keywords

approximation algorithms

fractional packing

network flows

MaRDI profile type

MaRDI publication profile

A capacity scaling algorithm for the constrained maximum flow problem

Potential function methods for approximately solving linear programming problems: theory and practice.

Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations

A double scaling algorithm for the constrained maximum flow problem

On a capacity scaling algorithm for the constrained maximum flow problem

A faster polynomial algorithm for the constrained maximum flow problem

A minimum spanning tree algorithm with inverse-Ackermann type complexity

Improved Algorithms For Linear Inequalities with Two Variables Per Inequality

Slowing down sorting networks to obtain faster sorting algorithms

Testing membership in matroid polyhedra

A note on two problems in connexion with graphs

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

Fast and simple approximation schemes for generalized flow.

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

Coordination Complexity of Parallel Price-Directive Decomposition

Geometric algorithms and combinatorial optimization.

Approximation Schemes for the Restricted Shortest Path Problem

Budget-constrained minimum cost flows

On the complexity and approximability of budget-constrained minimum cost flows

Maximum flows in generalized processing networks

Faster approximation schemes for fractional multicommodity flow problems

A characterization of the minimum cycle mean in a digraph

Combinatorial Optimization with Rational Objective Functions

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Combinatorial Approximation Algorithms for Generalized Flow Problems

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Combinatorial Optimization. Polyhedra and efficiency. CD-ROM

Approximate parametric searching

A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:684147

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q684147&oldid=36371278"