✦ LIBER ✦

Stackelberg network pricing is hard to approximate

✍ Scribed by Gwenaë Joret

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 90 KB
Volume: 57
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20391

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for Stackelbe

An approximation algorithm for Stackelberg network pricing

✍ Sébastien Roch; Gilles Savard; Patrice Marcotte 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

Approximating the SVP to within a Factor

Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions

✍ Jin-Yi Cai; Ajay Nerurkar 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Recently Ajtai showed that to approximate the shortest lattice vector in the l 2 -norm within a factor (1+2 &dim k ), for a sufficiently large constant k, is NP-hard under randomized reductions. We improve this result to show that to approximate a shortest lattice vector within a factor (1+dim &= ),

A stochastic approximation algorithm to

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

✍ Sumit Kunnumkal; Huseyin Topaloglu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

Developing networks. An introduction to

Developing networks. An introduction to the modeling of neural networks. P. Peretto. Cambridge: Cambridge University Press, 1992. No. of pages: xviii +473. ISBN 0-521- 42487-9. Price £24.95 (hard cover)

✍ Raphael Gillett 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

A systems biology view of evolutionary g

A systems biology view of evolutionary genetics : Network-driven processes incorporate much more variation than evolutionary genetics can handle. This variation is hard to formalise but allows fast change.

✍ Jonathan Bard 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB