1158 search results - page 172 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
143
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
197
click to vote
PR
2008
15 years 5 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
187
click to vote
CEC
2008
IEEE
16 years 17 days ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
154
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
161
click to vote
MASCOTS
2010
15 years 7 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...