11 search results - page 2 / 3 » Heuristic and exact approaches to the Quadratic Minimum Span... |
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
WEA
2010
Springer
14 years 10 hour ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
JUCS
2010
13 years 3 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
IPSN
2009
Springer
13 years 12 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...