7150 search results - page 57 / 1430 » An Approximation Algorithm for Approximation Rank |
162
click to vote
ICALP
2005
Springer
15 years 8 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, . . . ,...
106
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
140
click to vote
NETWORKS
2006
15 years 2 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
92
Voted
DAC
1999
ACM
16 years 3 months ago
1999
ACM
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...