✦ LIBER ✦

Improved Algorithms for Uniform Partitions of Points

✍ Scribed by P. K. Agarwal, B. K. Bhattacharya and S. Sen

Book ID: 120136523
Publisher: Springer
Year: 2002
Tongue: English
Weight: 182 KB
Volume: 32
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-001-0084-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for Un

Improved Approximation Algorithms for Uniform Connectivity Problems

✍ Samir Khuller; Balaji Raghavachari 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB

The problem of finding minimum-weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighted connectivity problems are given. Th

Matrix partitioning methods for interior

Matrix partitioning methods for interior point algorithms

✍ Romesh Saigal 📂 Article 📅 1997 🏛 Indian Academy of Sciences 🌐 English ⚖ 533 KB

Algorithms for minimum length partitions

Algorithms for minimum length partitions of polygons

✍ Andrzej Lingas; Christos Levcopoulos; Jörg Sack 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 378 KB

Improved algorithms for path partition a

Improved algorithms for path partition and related problems

✍ Danny Z. Chen; Haitao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Graph Partitioning Problems

✍ Gerold Jäger; Anand Srivastav 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 289 KB

On implementation choices for iterative

On implementation choices for iterative improvement partitioning algorithms

✍ Hagen, L.W.; Huang, D.J.-H.; Kahng, A.B. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 238 KB