16404 search results - page 213 / 3281 » A set coverage problem |
183
Voted
TAPAS
2011
14 years 10 months ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
117
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to...
118
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
132
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
129
click to vote
FCT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...