2137 search results - page 270 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
150
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
165
click to vote
JMLR
2006
15 years 6 months ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
157
click to vote
COCOON
2001
Springer
15 years 10 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
159
click to vote
INFOCOM
2009
IEEE
16 years 27 days ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
162
click to vote
APPROX
2009
Springer
16 years 25 days ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...