✦ LIBER ✦

Randomized parameterized algorithms for\(P_2\)-Packing and Co-Path Packing problems

✍ Scribed by Feng, Qilong; Wang, Jianxin; Li, Shaohua; Chen, Jianer

Book ID: 121593694
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 839 KB
Volume: 29
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-013-9691-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized algorithms for weighted ma

Parameterized algorithms for weighted matching and packing problems

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

A Fast Algorithm for the Path 2-Packing

A Fast Algorithm for the Path 2-Packing Problem

✍ Maxim A. Babenko 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 668 KB

Randomized Divide-and-Conquer: Improved

Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms

✍ Chen, Jianer; Kneis, Joachim; Lu, Songjian; Mölle, Daniel; Richter, Stefan; Ross 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 324 KB

Algorithms for packing and scheduling pr

Algorithms for packing and scheduling problems

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

Optimal Online Algorithms for Multidimen

Optimal Online Algorithms for Multidimensional Packing Problems

✍ Epstein, Leah; van Stee, Rob 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 226 KB

Efficient Approximation Algorithms for T

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add