227 search results - page 4 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
JGAA
2000
13 years 7 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...