Sciweavers

1671 search results - page 35 / 335
» On the Covering Steiner Problem
Sort
View
IPL
2011
112views more  IPL 2011»
13 years 6 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
FSTTCS
2009
Springer
14 years 5 months ago
The Covering and Boundedness Problems for Branching Vector Addition Systems
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
Stéphane Demri, Marcin Jurdzinski, Oded Lac...
ICALP
2004
Springer
14 years 4 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 4 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
COCOON
2005
Springer
14 years 4 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu