✦ LIBER ✦

Constant Approximation Algorithms for Rectangle Stabbing and Related Problems

✍ Scribed by Guang Xu; Jinhui Xu

Publisher: Springer
Year: 2005
Tongue: English
Weight: 231 KB
Volume: 40
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-005-1273-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

A Constant-Factor Approximation Algorith

A Constant-Factor Approximation Algorithm for thek-MST Problem

✍ Avrim Blum; R Ravi; Santosh Vempala 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Given an undirected graph with nonnegative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the opti

A Constant-Factor Approximation Algorith

A Constant-Factor Approximation Algorithm for the k-Median Problem

✍ Moses Charikar; Sudipto Guha; Éva Tardos; David B. Shmoys 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are rel

Space and time optimal algorithms for a

Space and time optimal algorithms for a class of rectangle intersection problems

✍ V.K. Vaishnavi; H.P. Kriegel; D. Wood 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Near-optimal hardness results and approx

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

✍ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs ðs i ; t i Þ; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo