𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local Search Algorithms for the Red-Blue Median Problem

✍ Scribed by M. Hajiaghayi; R. Khandekar; G. Kortsarz


Book ID
113044284
Publisher
Springer
Year
2011
Tongue
English
Weight
794 KB
Volume
63
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Local search algorithms for the k-cardin
✍ Christian Blum; Matthias Ehrgott πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th