✦ LIBER ✦

On the hardness of range assignment problems

✍ Scribed by Bernhard Fuchs

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 769 KB
Volume: 52
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20227

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The hardness of perfect phylogeny, feasi

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

✍ Hans L. Bodlaender; Michael R. Fellows; Michael T. Hallett; H.Todd Wareham; Tand 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 271 KB

In this paper, we consider the complexity of a number of combinatorial problems; namely, INTERVALIZING COLORED GRAPHS (DNA PHYSICAL MAPPING), TRIANGULATING COLORED GRAPHS (PERFECT PHYLOGENY), (DIRECTED) (MODIFIED) COLORED CUTWIDTH, FEASIBLE REGISTER ASSIGNMENT and MODULE ALLOCATION FOR GRAPHS OF BOU

Limits on the Hardness of Lattice Proble

Limits on the Hardness of Lattice Problems inℓpNorms

✍ Chris Peikert 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 576 KB

Determining Type II sensitivity ranges o

Determining Type II sensitivity ranges of the fractional assignment problem

✍ Chi-Jen Lin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 332 KB

The minimum broadcast range assignment p

The minimum broadcast range assignment problem on linear multi-hop wireless networks

✍ Andrea E.F. Clementi; Miriam Di Ianni; Riccardo Silvestri 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 162 KB

A labeling algorithm for the sensitivity

A labeling algorithm for the sensitivity ranges of the assignment problem

✍ Chi-Jen Lin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 589 KB

The Hardness of Approximating Spanner Pr

The Hardness of Approximating Spanner Problems

✍ Michael Elkin; David Peleg 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 366 KB