206 search results - page 14 / 42 » A distributed approximation algorithm for the minimum degree... |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
STACS
2001
Springer
14 years 3 days ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
PATMOS
2004
Springer
14 years 1 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...