✦ LIBER ✦

Improved algorithms for the multicut and multiflow problems in rooted trees

✍ Scribed by A. Tamir

Book ID: 107498308
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 293 KB
Volume: 16
Category: Article
ISSN: 1134-5764
DOI: 10.1007/s11750-007-0037-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Primal-dual approximation algorithms for

Primal-dual approximation algorithms for integral flow and multicut in trees

✍ N. Garg; V. V. Vazirani; M. Yannakakis 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 1000 KB

Erratum to “A greedy algorithm for multi

Erratum to “A greedy algorithm for multicut and integral multiflow in rooted tress” [Oper. Res. Lett. 31(1) (2003) 21–27]

✍ Marie-Christine Costa; Lucas Létocart; Frédéric Roupin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 97 KB

On the complexity of the multicut proble

On the complexity of the multicut problem in bounded tree-width graphs and digraphs

✍ Cédric Bentz 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Improved Approximation Algorithms for th

Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

✍ Marek Karpinski; Ion I. Mandoiu; Alexander Olshevsky; Alexander Zelikovsky 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 175 KB

Optimal parallel algorithms for coloring

Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

✍ G. Sajith; Sanjeev Saxena 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 474 KB

An improved algorithm for the minmax reg

An improved algorithm for the minmax regret median problem on a tree

✍ Igor Averbakh; Oded Berman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a “minmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because