A weighted directed graph G=(V,A,c), where A⊆ V× V and
c:A→ R, describes...
Assuming the Unique Games Conjecture (UGC), the best approximation ratio...
A resizable array is an array that can grow and shrink
by the addition o...
We survey three algorithms that use depth-first search to find strong
co...
MAX NAE-SAT is a natural optimization problem, closely related to its
be...
Each vertex of an arbitrary simple graph on n vertices chooses k random
...
We revisit multipass pairing heaps and path-balanced binary search trees...
We use soft heaps to obtain simpler optimal algorithms for selecting the...