✦ LIBER ✦

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

✍ Scribed by Chaoxia Yang; Guojun Li

Book ID: 113927512
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 230 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.08.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for We

Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

✍ Ho, Hann-Jang; Lee, SingLing 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 197 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for

✍ Jianping Li, Weidong Li, Lusheng Wang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 433 KB

On minimizing the maximum congestion for

On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle

✍ SingLing Lee; Hann-Jang Ho 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 77 KB

The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exact

A fully polynomial time approximation sc

A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios

✍ Sakib A. Mondal 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 339 KB

A Deterministic Polynomial-Time Approxim

A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions

✍ Štefankovič, Daniel; Vempala, Santosh; Vigoda, Eric 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB

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