Combinatorial approximation algorithms for generalized flow problems

DOI10.1006/JAGM.2000.1130MaRDI QIDQ2709797zbMATH OpenOpenAlexFDO

Authors Jeffrey D. Oldham

Publication date 7 October 2001

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2000.1130

zbMATH Keywords

network flow problems

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 108290
• Combinatorial Algorithms for the Generalized Circulation Problem
• Approximation and Online Algorithms
• Combinatorial algorithms for the unsplittable flow problem
• Approximation algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Combinatorial approaches to multiflow problems
• Algorithms and complexity analysis for some flow problems
• Approximation Algorithms for the Maximum Concurrent Flow Problem

Cited in

(22)

• A generalized approximation framework for fractional network flow and packing problems
• Monge and feasibility sequences in general flow problems
• Approximation and Online Algorithms
• Combinatorial Algorithms for the Generalized Circulation Problem
• A polynomial combinatorial algorithm for generalized minimum cost flow
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Faster algorithms for the generalized network flow problem
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
• A new algorithm for general matching problems using network flow subproblems
• Combinatorial approaches to multiflow problems
• Fast and simple approximation schemes for generalized flow.
• Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
• Shortest path and maximum flow problems in networks with additive losses and gains
• Optimal radio resources and transmission formats assignment in OFDMA systems
• A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
• Combinatorial algorithms for the unsplittable flow problem
• Robust flows with losses and improvability in evacuation planning
• Monotonizing linear programs with up to two nonzeroes per column
• Meet and merge: approximation algorithms for confluent flows
• Generalized max flow in series-parallel graphs

This page was built for publication: Combinatorial approximation algorithms for generalized flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709797)