✦ LIBER ✦

Hardness and inapproximability of convex recoloring problems

✍ Scribed by Campêlo, Manoel; Huiban, Cristiana; Sampaio, Rudini M.; Wakabayashi, Yoshiko

Book ID: 121785005
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 346 KB
Volume: 533
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.03.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved inapproximability of lattice an

Improved inapproximability of lattice and coding problems with preprocessing

✍ Regev, O. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 219 KB

NP-hardness of deciding convexity of qua

NP-hardness of deciding convexity of quartic polynomials and related problems

✍ Amir Ali Ahmadi, Alex Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 274 KB

NP-Hardness of Broadcast Scheduling and

NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow

✍ Thomas Erlebach; Alexander Hall 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 214 KB

Proof verification and the hardness of a

Proof verification and the hardness of approximation problems

✍ Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario 📂 Article 📅 1998 🏛 Association for Computing Machinery 🌐 English ⚖ 409 KB

On the hardness of range assignment prob

On the hardness of range assignment problems

✍ Bernhard Fuchs 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 769 KB

Local Structure of Convex Equilibrium Pr

Local Structure of Convex Equilibrium Problems

✍ R. POLYAK 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB