4 citations · 10 across the 24 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011★ 1 cited
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
Andrzej Lingas, Dzmitry Sledneu
We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an 0-1 matrix let be the comp…
cs.DS2011
Near approximation of maximum weight matching through efficient weight reduction
Andrzej Lingas, Cui Di
Let G be an edge-weighted hypergraph on n vertices, m edges of size \le s, where the edges have real weights in an interval [1,W]. We show that if we can approximate a maximum weig…