𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight approximation bounds for combinatorial frugal coverage algorithms

✍ Scribed by Ioannis Caragiannis, Christos Kaklamanis…

Book ID
120694132
Publisher
Springer US
Year
2012
Tongue
English
Weight
579 KB
Volume
26
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial Approximation Algorithms f
Combinatorial Approximation Algorithms for Generalized Flow Problems
✍ Jeffrey D Oldham 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier µ v w for each arc v w . For every unit of flow entering the arc, µ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi

A tight bound for approximating the squa
A tight bound for approximating the square root
✍ Nader H. Bshouty; Yishay Mansour; Baruch Schieber; Prasoon Tiwari 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 285 KB

We prove an R (log log( l/c) ) lower bound on the depth of any computation tree and any RAM program with operations {+, -, \*, /, [.j, not, and, br, xor}, unlimited power of answering YES/NO questions, and constants (0.1) that computes 4 to accuracy E, for all x E [ 1,2]. Since the Newton method ach