✦ LIBER ✦

A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

✍ Scribed by R. E. Burkard; J. Krarup

Book ID: 110625326
Publisher: Springer Vienna
Year: 1998
Tongue: English
Weight: 865 KB
Volume: 60
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02684332

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial method for the pos/neg weig

A polynomial method for the pos/neg weighted 3-median problem on a tree

✍ Rainer E. Burkard; Jafar Fathali 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 212 KB

The pos/neg-weighted 1-median problem on

The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers

✍ Yukun Cheng; Liying Kang; Changhong Lu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 732 KB

A linear time algorithm for the reverse

A linear time algorithm for the reverse 1-median problem on a cycle

✍ Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

A linear-time approximation algorithm fo

A linear-time approximation algorithm for the weighted vertex cover problem

✍ R Bar-Yehuda; S Even 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 257 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 linear time algorithm for the weighted

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

✍ Nir Halman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB