136 search results - page 21 / 28 » A Constant-Factor Approximation Algorithm for the k-Median P... |
120
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
123
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
125
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
128
click to vote
ADHOCNETS
2009
Springer
15 years 9 months ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
119
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...