19 search results - page 3 / 4 » Hardness of the undirected congestion minimization problem |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
WWW
2011
ACM
13 years 4 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
PODC
2005
ACM
14 years 3 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...