𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate algorithms for partitioning problems

✍ Scribed by Mohammad Ashraf Iqbal

Publisher
Springer
Year
1991
Tongue
English
Weight
999 KB
Volume
20
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation Algorithms for Maximizatio
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
✍ Uriel Feige; Michael Langberg πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 261 KB

Given a graph G = V E , a weight function w E β†’ R + , and a parameter k, we consider the problem of finding a subset U βŠ† V of size k that maximizes: Max-Vertex Cover k the weight of edges incident with vertices in U, Max-Dense Subgraph k the weight of edges in the subgraph induced by U, Max-Cut k th

Constant Ratio Approximation Algorithms
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
✍ Daya Ram Gaur; Toshihide Ibaraki; Ramesh Krishnamurti πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 114 KB

We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a set of rectangles in two-dimensional space, with the objective of stabbing all rectangles with the m