7129 search results - page 163 / 1426 » Approximation Algorithms for Treewidth |
134
Voted
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
144
Voted
AAIM
2010
Springer
15 years 6 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
138
Voted
DAM
1999
15 years 3 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
110
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM