1998 search results - page 9 / 400 » Complexity of the Cover Polynomial |
CCCG
2006
13 years 11 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
ICGI
2010
Springer
13 years 11 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
ISAAC
2000
Springer
14 years 1 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
ER
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...