1480 search results - page 15 / 296 » Distributed algorithms for weighted problems in sparse graph... |
SIAMCOMP
2010
13 years 2 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
DAM
2006
13 years 7 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
FCS
2006
13 years 8 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...