✦ LIBER ✦

Exact algorithms for problems related to the densest k-set problem

✍ Scribed by Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju; Rossmanith, Peter; Wu, Guan-Han

Book ID: 122150369
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 212 KB
Volume: 114
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.04.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for the maximum stabl

An exact algorithm for the maximum stable set problem

✍ Carlo Mannino; Antonio Sassano 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 795 KB

A set-partitioning-based exact algorithm

A set-partitioning-based exact algorithm for the vehicle routing problem

✍ Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 899 KB

Exact and Approximation Algorithms for G

Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems

✍ Berman, Piotr; Karpinski, Marek; Lingas, Andrzej 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 565 KB

Exact algorithms for the master ring pro

Exact algorithms for the master ring problem

✍ Hadas Shachnai; Lisa Zhang; Tomomi Matsui 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings __R__~1~,…,__R__~__K__~, with __n__~1~,…,__n__~__K__~ distinct nodes, respectively, we need to find an ordering of the nodes in

Parallel Algorithms for Partitioning Sor

Parallel Algorithms for Partitioning Sorted Sets and Related Problems

✍ D. Z. Chen, W. Chen, K. Wada and K. Kawaguchi 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 272 KB

Algorithms for the Set Covering Problem

✍ Alberto Caprara; Paolo Toth; Matteo Fischetti 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 101 KB