453 search results - page 40 / 91 » On Approximation of Bookmark Assignments |
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
DCOSS
2009
Springer
14 years 2 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
P2P
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently there has been an increasing interest to harness the potential of P2P technology to design and build rich environments where services are provided and multiple applicatio...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...