
Maintaining Exact Distances under Multiple Edge Failures
We present the first compact distance oracle that tolerates multiple fai...
read it

Faster Algorithms for BoundedDifference MinPlus Product
Minplus product of two n× n matrices is a fundamental problem in algori...
read it

NearOptimal TimeEnergy TradeOffs for Deterministic Leader Election
We consider the energy complexity of the leader election problem in the ...
read it

A Scaling Algorithm for Weighted fFactors in General Graphs
We study the maximum weight perfect ffactor problem on any general simp...
read it

Approximate Distance Oracles Subject to Multiple Vertex Failures
Given an undirected graph G=(V,E) of n vertices and m edges with weights...
read it

Roundtrip Spanners with (2k1) Stretch
A roundtrip spanner of a directed graph G is a subgraph of G preserving ...
read it

Boundary EffectAware Visual Tracking for UAV with Online Enhanced Background Learning and MultiFrame Consensus Verification
Due to implicitly introduced periodic shifting of limited searching area...
read it

Faster Algorithms for All Pairs Nondecreasing Paths Problem
In this paper, we present an improved algorithm for the All Pairs Nonde...
read it

SingleSource Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs
In a directed graph G=(V,E) with a capacity on every edge, a bottleneck ...
read it

Nearlinear Time Algorithms for Approximate Minimum Degree Spanning Trees
Given a graph G = (V, E), n=V, m=E, we wish to compute a spanning tr...
read it
Ran Duan
is this you? claim profile