✦ LIBER ✦

Parameterized and approximation algorithms for finding two disjoint matchings

✍ Scribed by Chen, Zhi-Zhong; Fan, Ying; Wang, Lusheng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

1-Approximation algorithm for bottleneck

✍ Alak K. Datta; Ranjan K. Sen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 331 KB

A 3/4-approximation algorithm for findin

✍ A. A. Ageev; A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 610 KB

Bi-criteria and approximation algorithms

✍ Mastrolilli, Monaldo; Stamoulis, Georgios 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Approximation algorithms for forests aug

✍ Victor Chepoi; Bertrand Estellon; Yann Vaxès 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 974 KB

Improved approximation algorithms for co

✍ Guo, Longkun; Shen, Hong; Liao, Kewen 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 287 KB

Parameterized algorithms for weighted ma

✍ Jianxin Wang; Yunlong Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 617 KB