462 search results - page 61 / 93 » Covering a Tree by a Forest |
ESA
2003
Springer
14 years 3 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
ISMIR
2005
Springer
14 years 3 months ago
2005
Springer
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
VLDB
2007
ACM
14 years 10 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...