Approximate distance oracles

The most impressive feature of the data structure is its constant query time, hence the name ``oracle', which provides faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs. Expand Reachability and distance queries via 2-hop labels

The proposed data structure for representing all distances in a graph is distributed in the sense that it may be viewed as assigning labels to the vertices, such that a query involving vertices u and v may be answered using only the labels of u andV. Expand The Complexity of Mean Payoff Games on Graphs

A pseudo-polynomial-time algorithm for the solution of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan, is described. Expand Finding and counting given length cycles

An assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs improve upon various previously known results. Expand All pairs shortest paths using bridging sets and rectangular matrix multiplication

- U. Zwick
- Computer Science, Mathematics
- JACM
- 16 August 2000

Two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs using fast matrix multiplication algorithms are presented. Expand A 7/8-approximation algorithm for MAX 3SAT?

A randomized approximation algorithm which takes an instance of MAX 3SAT as input that is optimal if the instance-a collection of clauses each of length at most three-is satisfiable, and a method of obtaining direct semidefinite relaxations of any constraint satisfaction problem of the form MAX CSP(F), where F is a finite family of Boolean functions. Expand Approximate distance oracles

The most impressive feature of the data structure is its constant query time, hence the name "oracle", and it provides faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs. Expand All-Pairs Almost Shortest Paths

A simple argument shows that computing all distances in G with an additive one-sided error of at most 1 is as hard as Boolean matrix multiplication, and describes an APASP2 algorithm, which is simple, easy to implement, and faster than the fastest known matrix-multiplication algorithm. Expand