Polynomiality of sparsest cuts with fixed number of sources

Authors:
Sung-Pil Hong;Byung-Cheon Choi
Affiliations:
Department of Industrial Engineering, Seoul National University, Seoul, Republic of Korea;Semiconductor Business, Samsung Electronics Co., LTD., Gyeonggi-Do, Republic of Korea
Venue:
Operations Research Letters
Year:
2007

Citing 6
Cited 0

A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
The maximum concurrent flow problem

Journal of the ACM (JACM)
Sparsest cuts and bottlenecks in graphs

Discrete Applied Mathematics - Computational combinatiorics
Cut problems and their application to divide-and-conquer

Approximation algorithms for NP-hard problems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
A New Min-Cut Max-Flow Ratio for Multicommodity Flows

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time.