523 search results - page 6 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
DAM
2006
13 years 7 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
AAIM
2008
Springer
14 years 1 months ago
2008
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 ...
APPROX
2009
Springer
14 years 2 months 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 ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...