16 search results - page 2 / 4 » Approximating the Generalized Capacitated Tree-Routing Probl... |
MST
2010
13 years 10 days 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...
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
13 years 11 months ago
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
CIAC
2010
Springer
13 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
WADS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...