Sciweavers

3875 search results - page 61 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
ICCS
2003
Springer
14 years 2 months ago
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
Ana Paula Tomás, António Leslie Baju...
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
14 years 2 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
WG
2005
Springer
14 years 2 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
14 years 5 months ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha