✦ LIBER ✦

Efficient Approximation Algorithms for the Subset-Sums Equality Problem

✍ Scribed by Cristina Bazgan; Miklos Santha; Zsolt Tuza

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 117 KB
Volume: 64
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1784

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Network Des

Approximation Algorithms for Network Design Problems on Bounded Subsets

✍ Dorit S. Hochbaum; Joseph (Seffi) Naor 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher

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

Approximation algorithm for the group St

Approximation algorithm for the group Steiner network problem

✍ Michal Penn; Stas Rozenfeld 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract In this article we study the __group Steiner network__ problem, which is defined in the following way. Given a graph __G__ = (__V,E__), a partition of its vertices into K groups and connectivity requirements between the different groups, the aim is to find simultaneously a set of repres

Approximation algorithms for the k-sourc

Approximation algorithms for the k-source multicast tree construction problem

✍ Paraskevi Fragopoulou 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

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

A Polylogarithmic Approximation Algorith

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

✍ Naveen Garg; Goran Konjevod; R. Ravi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group.The problem was introduced by Reich a