1424 search results - page 9 / 285 » The Multi-radius Cover Problem |
COCOON
2004
Springer
14 years 4 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
MP
1998
13 years 10 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
IPL
2011
13 years 5 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...
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
ICALP
2004
Springer
14 years 4 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 ...