✦ LIBER ✦

Parameterized algorithms for weighted matching and packing problems

✍ Scribed by Jianxin Wang; Yunlong Liu

Book ID: 108114382
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 617 KB
Volume: 5
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2008.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distributed algorithms for covering, pac

Distributed algorithms for covering, packing and maximum weighted matching

✍ Christos Koufogiannakis; Neal E. Young 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 396 KB

Efficient Algorithms for Variants of Wei

Efficient Algorithms for Variants of Weighted Matching and Assignment Problems

✍ Satyajit Banerjee; Atish Datta Chowdhury; Subhas Kumar Ghosh 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 218 KB

Parameterized Pattern Matching: Algorith

Parameterized Pattern Matching: Algorithms and Applications

✍ Brenda S. Baker 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 416 KB

The problem of finding sections of code that either are identical or are related by the systematic renaming of variables or constants can be modeled in terms of parameterized strings ( p-strings) and parameterized matches ( p-matches). P-strings are strings over two alphabets, one of which represent

Approximation algorithms for weighted ma

Approximation algorithms for weighted matching

✍ Shankar M. Venkatesan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Algorithms for packing and scheduling pr

Algorithms for packing and scheduling problems

✍ Michele Monaci 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 37 KB

Las Vegas RNC algorithms for unary weigh

Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems

✍ Joel Wein 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 896 KB