✦ LIBER ✦

A polynomial time approximation scheme for

✍ Scribed by Jianping Li, Weidong Li, Lusheng Wang

Book ID: 118801976
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 433 KB
Volume: 24
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-011-9387-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

✍ Chekuri, Chandra; Khanna, Sanjeev 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling

✍ Chen, Jianer; Miranda, Antonio 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 215 KB

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways

✍ Xiuzhen Cheng; Joon-Mo Kim; Bing Lu 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 127 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the SONET ring loading problem

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views

A Polynomial-Time Approximation Scheme f

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

✍ Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chu 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 409 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

✍ Chaoxia Yang; Guojun Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 230 KB