1158 search results - page 42 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
231
click to vote
DC
2011
14 years 4 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
131
click to vote
ISSAC
1995
Springer
15 years 8 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
154
click to vote
ECCC
2006
15 years 4 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
122
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
149
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...