1486 search results - page 46 / 298 » Algorithms for two-box covering |
89
Voted
TCC
2007
Springer
15 years 7 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
102
click to vote
SIGECOM
2003
ACM
15 years 6 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
82
Voted
DAC
1994
ACM
15 years 4 months ago
1994
ACM
State minimization of incompletely specifiedmachinesis an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate ...
90
Voted
ICCNMC
2005
Springer
15 years 6 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
104
click to vote
ESA
2006
Springer
15 years 4 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...