57 search results - page 7 / 12 » Logarithmic hardness of the directed congestion minimization... |
127
click to vote
MST
2010
14 years 6 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
122
click to vote
GLOBECOM
2009
IEEE
15 years 3 months ago
2009
IEEE
A common objective of Internet traffic engineering is to minimize the maximal link utilization in a network in order to accommodate more traffic and reduce the chance of congestion...
IPSN
2009
Springer
15 years 6 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
STACS
2004
Springer
15 years 5 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
117
click to vote
FPGA
1995
ACM
15 years 3 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...