217 search results - page 6 / 44 » Approximating Minimum Manhattan Networks |
165
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
158
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
92
Voted
SIGCOMM
1999
ACM
15 years 5 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
112
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
DCOSS
2007
Springer
15 years 4 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...