SIAMCOMP 1998 - PDF Preprint Papers

SIAMCOMP 1998

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMCOMP-1998 Paper

click to vote

SIAMCOMP
1998

176views more SIAMCOMP 1998»

An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

13 years 11 months ago

Download u.cs.biu.ac.il

It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent ﬂow for k-commodity ﬂow instances with arbitrary capacities and demands. This im...

Yonatan Aumann, Yuval Rabani

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	176	An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm	claim
2	168	Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs	claim
3	162	Hypercubic Sorting Networks	claim
4	141	Randomized Data Structures for the Dynamic Closest-Pair Problem	claim
5	138	Dynamic Trees and Dynamic Point Location	claim
6	137	Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs	claim
7	126	Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost	claim
8	125	Free Bits, PCPs, and Nonapproximability-Towards Tight Results	claim
9	124	Near-Linear Time Construction of Sparse Neighborhood Covers	claim
10	118	Genericity, Randomness, and Polynomial-Time Approximations	claim
11	117	The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms	claim
12	114	Universal Limit Laws for Depths in Random Trees	claim
13	114	Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms	claim
14	113	Two-Dimensional Periodicity in Rectangular Arrays	claim
15	111	Computing the Local Consensus of Trees	claim
16	108	Incremental String Comparison	claim
17	102	L-Printable Sets	claim
18	99	On the Power of Finite Automata with Both Nondeterministic and Probabilistic States	claim
19	98	Failure Detection and Randomization: A Hybrid Approach to Solve Consensus	claim
20	96	Fault-Tolerant Computation in the Full Information Model	claim
21	93	Localizing a Robot with Minimum Travel	claim
22	92	Surface Approximation and Geometric Partitions	claim
23	86	Exact Learning of Discretized Geometric Concepts	claim
24	85	Separator-Based Sparsification II: Edge and Vertex Connectivity	claim
25	68	Guaranteeing Fair Service to Persistent Dependent Tasks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers