✦ LIBER ✦

Algorithms for the Homogeneous Set Sandwich Problem

✍ Scribed by Celina M.H. de Figueiredo; Guilherme D. da Fonseca; Vinicius G.P. de Sa; Jeremy Spinrad

Publisher: Springer
Year: 2006
Tongue: English
Weight: 408 KB
Volume: 46
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-005-1198-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust Algorithms for the Stable Set Pro

Robust Algorithms for the Stable Set Problem

✍ Michael U. Gerber; Vadim V. Lozin 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 320 KB

On-line algorithms for the dominating se

On-line algorithms for the dominating set problem

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Implicit enumeration algorithms for the

Implicit enumeration algorithms for the Set-Partitioning Problem

✍ S. Albers 📂 Article 📅 1980 🏛 Springer 🌐 German ⚖ 797 KB

Efficient heuristic algorithms for the w

Efficient heuristic algorithms for the weighted set covering problem

✍ Edward K. Baker 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Computational experience with approximat

Computational experience with approximation algorithms for the set covering problem

✍ Tal Grossman; Avishai Wool 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith

Fast algorithms for the dominating set p

Fast algorithms for the dominating set problem on permutation graphs

✍ Kuo-Hui Tsai; Wen-Lian Hsu 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 616 KB