344 search results - page 54 / 69 » A constant factor approximation algorithm for a class of cla... |
ESA
2006
Springer
13 years 11 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...
STOC
2002
ACM
14 years 7 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...
STOC
2005
ACM
14 years 7 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 ...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...