A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-540-24592-6_22

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Approximation Algorithm for Extended Maximum---- Concurrent Flow Problem With Saturated Capacity

2015English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem

Mathematical Problems in Engineering
MathematicsEngineering
2011English

A New Approximation Algorithm for the Multilevel Facility Location Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

A 2-Approximation Algorithm for the Online Tethered Coverage Problem

2019English

Approximation Algorithm for the Kinetic Robust K-Center Problem

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2010English

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms

1989English

Outer Approximation Method for the Minimum Maximal Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy