3875 search results - page 600 / 775 » Approximation algorithms for the 0-extension problem |
187
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
225
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
179
click to vote
JACM
2006
15 years 7 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
221
Voted
WCNC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
191
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...