151 search results - page 7 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
177
click to vote
SLS
2009
Springer
15 years 10 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
149
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
135
click to vote
STOC
2006
ACM
15 years 9 months 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...
151
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
170
Voted
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...