𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive filtering with bandwidth constraints in the feedback path

✍ Scribed by György Orosz; László Sujbert; Gábor Péceli


Book ID
113901952
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
433 KB
Volume
92
Category
Article
ISSN
0165-1684

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the Inapproximability of Disjoint Pat
✍ Bin Ma; Lusheng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we study the inapproximability of several well-known optimization problems in network optimization. We show-that the max directed vertex-disjoint paths problem cannot be approximated within ratio 2 log 1&= n unless NP DTIME[2 polylog n ], the max directed edge-disjoint paths problem c