1433 search results - page 31 / 287 » On Covering Problems of Rado |
199
click to vote
ISAAC
2000
Springer
15 years 9 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
138
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
152
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
163
click to vote
TCS
2008
15 years 5 months ago
2008
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
183
click to vote
FAW
2008
Springer
15 years 7 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...