✦ LIBER ✦

Approximation algorithms and hardness results for

✍ Scribed by Refael Hassin; Jérôme Monnot; Danny Segev

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 498 KB
Volume: 14
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9044-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Near-optimal hardness results and approx

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

✍ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs ðs i ; t i Þ; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo

Approximation and hardness results for l

Approximation and hardness results for label cut and

✍ Peng Zhang; Jin-Yi Cai; Lin-Qing Tang; Wen-Bo Zhao 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 529 KB

Hardness and algorithms for rainbow conn

Hardness and algorithms for rainbow connection

✍ Sourav Chakraborty; Eldar Fischer; Arie Matsliah; Raphael Yuster 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 585 KB

Domination in graphs with bounded propag

Domination in graphs with bounded propagation: algorithms, formulations and hardness results

✍ Ashkan Aazami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 733 KB

Hardness Results for Homology Localizati

Hardness Results for Homology Localization

✍ Chao Chen; Daniel Freedman 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 956 KB

Approximation Algorithms for Treewidth

✍ Eyal Amir 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 745 KB