2957 search results - page 21 / 592 » The Complexity of Polynomial-Time Approximation |
IS
2010
13 years 6 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
CCCG
2006
13 years 9 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...
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
TAMC
2009
Springer
14 years 2 days ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...