195 search results - page 13 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...