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

doi 10.21236/ada211908
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

A Uniform Min-Max Theorem With Applications in Cryptography

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Reduced Graphs for Min-Cut/Max-Flow Approaches in Image Segmentation

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

An Extension of Min/Max Flow Framework

Image and Vision Computing
ElectricalComputer VisionSignal ProcessingPattern RecognitionElectronic Engineering
2009English

Clutters That Pack and the Max Flow Min Cut Property: A Conjecture

1993English

A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Approximate Max K-Cut With Subgraph Guarantee

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1998English

Centralized and Distributed Approximation Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy