✦ LIBER ✦

Inapproximability and approximability of maximal tree routing and coloring

✍ Scribed by Xujin Chen; Xiaodong Hu; Tianping Shuai

Book ID: 106407026
Publisher: Springer US
Year: 2006
Tongue: English
Weight: 449 KB
Volume: 11
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-7135-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tractability and approximability of maxi

Tractability and approximability of maximal strip recovery

✍ Laurent Bulteau; Guillaume Fertin; Minghui Jiang; Irena Rusu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Approximability of unsplittable shortest

Approximability of unsplittable shortest path routing problems

✍ Andreas Bley 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

A survey of approximability and inapprox

A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

✍ Nguyen, Trung Thanh; Roos, Magnus; Rothe, Jörg 📂 Article 📅 2013 🏛 Springer Netherlands 🌐 English ⚖ 416 KB

Coloring the Maximal Cliques of Graphs

✍ Bacsó, Gábor; Gravier, Sylvain; Gyárfás, András; Preissmann, Myriam; Sebo, Andrá 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 195 KB

Inapproximability of Edge-Disjoint Paths

Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs

✍ Matthew Andrews; Julia Chuzhoy; Venkatesan Guruswami; Sanjeev Khanna; Kunal Talw 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 441 KB

Approximation and inapproximability resu

Approximation and inapproximability results for maximum clique of disc graphs in high dimensions

✍ Peyman Afshani; Hamed Hatami 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 120 KB