7930 search results - page 26 / 1586 » Greedy in Approximation Algorithms |
107
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
127
click to vote
WABI
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Applied Biosystems’ SOLiD system offers a low-cost alternative to the traditional Sanger method of DNA sequencing. We introduce two main algorithms of mapping SOLiD’...
106
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
101
click to vote
AOR
2007
15 years 2 months ago
2007
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and answered a question in Gutin and Yeo, Oper. Res. Lett. 30 (2002), 97–99.
CORR
2002
Springer
15 years 2 months ago
2002
Springer
Inthisarticle,wewillformalizethemethodofdualfittingandtheideaoffactor-revealingLP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated...