16404 search results - page 411 / 3281 » A set coverage problem |
152
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
171
click to vote
AAIM
2007
Springer
16 years 28 days ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
179
click to vote
ICALP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
142
click to vote
MFCS
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
131
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...