720 search results - page 23 / 144 » Linear k-arboricities on trees |
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
ACTA
2000
13 years 8 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
CSMR
2009
IEEE
14 years 1 months ago
2009
IEEE
There is an increasing interest in more accurate prediction of software maintainability in order to better manage and control software maintenance. Recently, TreeNet has been prop...