3875 search results - page 111 / 775 » Approximation Algorithms for the Max-coloring Problem |
ESA
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
IPCO
1996
13 years 10 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
HEURISTICS
2006
13 years 9 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
PEPM
1995
ACM
14 years 15 days ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
IPL
2008
13 years 9 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...