183 search results - page 11 / 37 » On the Matching Problem for Special Graph Classes |
112
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
139
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
130
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
104
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
COMBINATORICS
2006
15 years 1 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...