57 search results - page 1 / 12 » Logarithmic hardness of the directed congestion minimization... |
STOC
2006
ACM
14 years 6 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
ECCC
2006
13 years 6 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
MFCS
2007
Springer
14 years 12 days ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...