Sciweavers

7930 search results - page 113 / 1586
» Greedy in Approximation Algorithms
Sort
View
STOC
2003
ACM
100views Algorithms» more  STOC 2003»
16 years 6 months ago
Simpler and better approximation algorithms for network design
Anupam Gupta, Amit Kumar, Tim Roughgarden
CPAIOR
2009
Springer
16 years 27 days ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 6 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela
STOC
2006
ACM
76views Algorithms» more  STOC 2006»
16 years 6 months ago
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov, Vaughan Jones, Zeph Landau
ALT
2009
Springer
16 years 3 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes