1671 search results - page 118 / 335 » On the Covering Steiner Problem |
99
Voted
IPCO
2001
15 years 2 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
94
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
116
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
WDAG
2009
Springer
15 years 7 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...