1480 search results - page 90 / 296 » Distributed algorithms for weighted problems in sparse graph... |
124
Voted
AAIM
2008
Springer
15 years 4 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
116
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
125
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
164
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
107
Voted
IPL
2002
15 years 2 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...