1480 search results - page 15 / 296 » Distributed algorithms for weighted problems in sparse graph... |
150
click to vote
SIAMCOMP
2010
14 years 11 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...
146
click to vote
DAM
2006
15 years 5 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...
144
Voted
FCS
2006
15 years 6 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...
154
click to vote
SIGECOM
2009
ACM
15 years 11 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...
172
click to vote
ICASSP
2011
IEEE
14 years 8 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...