142 search results - page 3 / 29 » Approximate maximum weight branchings |
CORR
2010
Springer
14 years 6 months ago
2010
Springer
140
click to vote
WG
2004
Springer
15 years 5 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
168
click to vote
DC
2011
13 years 11 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...
121
Voted
ECML
2006
Springer
15 years 3 months ago
2006
Springer
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
DAM
2006
14 years 11 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...