94 search results - page 18 / 19 » Capacity inverse minimum cost flow problem |
146
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
155
click to vote
ICCAD
2009
IEEE
15 years 2 months ago
2009
IEEE
Decoupling capacitance (decap) is an efficient way to reduce transient noise in on-chip power supply networks. However, excessive decap may cause more leakage power, chip resource...
133
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
141
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
266
click to vote
GIS
2005
ACM
16 years 6 months ago
2005
ACM
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...