337 search results - page 15 / 68 » Semidefinite Programming Based Approximation Algorithms |
105
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
132
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
114
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
113
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
138
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...