681 search results - page 47 / 137 » General Polynomial Time Decomposition Algorithms |
ALGORITHMICA
2004
15 years 12 days ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
102
click to vote
FOCS
2005
IEEE
15 years 6 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...
104
Voted
RECOMB
2010
Springer
14 years 11 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
99
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...