✦ LIBER ✦

Improved approximations for the minimum-cut ratio and the flux

✍ Scribed by S. Tragoudas

Book ID: 112511933
Publisher: Springer
Year: 1996
Tongue: English
Weight: 624 KB
Volume: 29
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01305312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved approximation ratio for the

An improved approximation ratio for the minimum latency problem

✍ Michel Goemans; Jon Kleinberg 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 860 KB

An improved approximation ratio for the

An improved approximation ratio for the minimum linear arrangement problem

✍ Uriel Feige; James R. Lee 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 108 KB

Improved approximation bounds for the mi

Improved approximation bounds for the minimum rainbow subgraph problem

✍ Ján Katrenič; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Improved Approximation Results for the M

Improved Approximation Results for the Minimum Energy Broadcasting Problem

✍ Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 459 KB

Improved bounds on the max-flow min-cut

Improved bounds on the max-flow min-cut ratio for multicommodity flows

✍ Serge Plotkin; Éva Tardos 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 671 KB

A Better Approximation Ratio for the Min

A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem

✍ Cristina G Fernandes 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo