206 search results - page 35 / 42 » Constant factor approximation algorithm for the knapsack med... |
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...
141
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
141
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
124
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...
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 ...