✦ LIBER ✦

An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem

✍ Scribed by Hiroyuki Miyazawa; Thomas Erlebach

Book ID: 111594821
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 237 KB
Volume: 7
Category: Article
ISSN: 1094-6136
DOI: 10.1023/b:josh.0000031423.39762.d3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A randomized algorithm for the on-line w

A randomized algorithm for the on-line weighted bipartite matching problem

✍ Béla Csaba; András Pluhár 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 283 KB

Improved Randomized On-Line Algorithms f

Improved Randomized On-Line Algorithms for the List Update Problem

✍ Albers, Susanne 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 308 KB

An improved, randomized algorithm for pa

An improved, randomized algorithm for parallel selection with an experimental study

✍ David A. Bader 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A linear-time algorithm for the weighted

A linear-time algorithm for the weighted feedback vertex problem on interval graphs

✍ Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 459 KB

We present a linear-time algorithm for finding a minimum weighted feedback vertex set on interval graphs using the dynamic programming technique. Since the weighted feedback vertex problem, the weighted C3.1 problem, the maximum weighted 2-colorable subgraph problem and the maximum weighted 2-indepe

A randomized algorithm for the min-max s

A randomized algorithm for the min-max selecting items problem with uncertain weights

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 311 KB

An algorithm for selecting main points o

An algorithm for selecting main points on a line

✍ G. Dettori; B. Falcidieno 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 361 KB