334 search results - page 63 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
72
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
SIAMCOMP
2010
14 years 8 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
150
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...