352 search results - page 46 / 71 » Experimental Analysis of Approximation Algorithms for the Ve... |
172
Voted
PETRA
2009
ACM
16 years 4 days ago
2009
ACM
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
158
click to vote
IVC
2007
15 years 5 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
168
click to vote
NETWORKS
2011
15 years 17 days ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
166
click to vote
COLT
2006
Springer
15 years 9 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
143
Voted
DCOSS
2009
Springer
16 years 5 days 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...