1433 search results - page 12 / 287 » On Covering Problems of Rado |
84
Voted
IPL
2011
14 years 4 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
64
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
105
click to vote
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
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 ...
89
Voted
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
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...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
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...