473 search results - page 6 / 95 » Computing excluded minors |
DM
2002
13 years 7 months ago
2002
For each prime p, we construct an infinite antichain of matroids in which each matroid has characteristic set {p}. For p = 2, each of the matroids in our antichain is an excluded m...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
FOCS
2003
IEEE
14 years 20 days ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...