Search Results - "Zwick, U."

Finding and counting given length cycles by ALON, N, YUSTER, R, ZWICK, U

Get full text

Competitive analysis of the LRFU paging algorithm by COHEN, E, KAPLAN, H, ZWICK, U

Get full text

Which bases admit non-trivial shrinkage of formulae? by Chockler, H., Zwick, U.

Get full text

The communication complexity of the universal relation by Tardos, G., Zwick, U.

“…Consider the following communication problem. Alice gets a word x/spl isin/{0,1}/sup n/ and Bob gets a word y/spl isin/{0,1}/sup n/. Alice and Bob are told…”
Get full text

The complexity of mean payoff games on graphs by Zwick, Uri, Paterson, Mike

“…We study the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by…”
Get full text

All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms by Zwick, U.

“…We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix…”
Get full text

Dynamic approximate all-pairs shortest paths in undirected graphs by Roditty, L., Zwick, U.

“…We obtain three dynamic algorithms for the approximate all-pairs shortest paths problem in unweighted undirected graphs: 1) For any fixed /spl epsiv/ > 0, a…”
Get full text

Answering distance queries in directed graphs using fast matrix multiplication by Yuster, R., Zwick, U.

“…Let G = (V, E, w) be a weighted directed graph, where w : E /spl rarr/ {-M, ..., 0, ..., M}. We show that G can be preprocessed in O/spl tilde/(Mn/sup /spl…”
Get full text

A note on busy beavers and other creatures by Ben-Amram, A. M., Julstrom, B. A., Zwick, U.

Get full text

A 7/8-approximation algorithm for MAX 3SAT? by Karloff, H., Zwick, U.

“…We describe a randomized approximation algorithm which takes an instance of MAX 3SAT as input. If the instance-a collection of clauses each of length at most…”
Get full text

Improved dynamic reachability algorithms for directed graphs by Roditty, L., Zwick, U.

“…We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph, and several other algorithms for answering reachability…”
Get full text

A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems by Halperin, Eran, Zwick, Uri

“…We obtain improved semidefinite programming based approximation algorithms for all the natural maximum bisection problems of graphs. Among the problems…”
Get full text

Approximating MIN 2-SAT and MIN 3-SAT by Avidor, Adi, Zwick, Uri

“…We obtain substantially improved approximation algorithms for the MIN k-SAT problem, for k = 2,3. More specifically, we obtain a 1.1037-approximation algorithm…”
Get full text

MAX CUT in cubic graphs by Halperin, Eran, Livnat, Dror, Zwick, Uri

“…We present an improved semidefinite programming based approximation algorithm for the MAX CUT problem in graphs of maximum degree at most 3. The approximation…”
Get full text

All pairs almost shortest paths by Dor, D., Halperin, S., Zwick, U.

“…Let G=(V,E) be an unweighted undirected graph on n vertices. A simple argument shows that computing all distances in G with an additive one-sided error of at…”
Get full text

SOKOBAN and other motion planning problems by Dor, Dorit, Zwick, Uri

“…We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to…”
Get full text

Median selection requires (2+/spl epsiv/)n comparisons by Dor, D., Zwick, U.

“…Improving a long standing result of Bent and John (1985), we obtain a (2+/spl epsiv/)n lower bound (for some fixed /spl epsiv/>0) on the number of comparisons…”
Get full text

All-Pairs Small-Stretch Paths by Cohen, Edith, Zwick, Uri

“…Let G=(V,E) be a weighted undirected graph. A path between u,v∈V is said to be of stretch t if its length is at most t times the distance between u and v in…”
Get full text

The Performance of an Amplitude Fourier Spectrometer for Far-Infrared Solid-State Spectroscopy by Gast, J., Genzel, L., Zwick, U.

“…A far-infrared Fourier interferometer for amplitude-phase reflection spectroscopy on solids is described. It can be used with small samples at low temperatures…”
Get full text

Amplification and percolation (probabilistic Boolean functions) by Dubiner, M., Zwick, U.

“…The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily…”
Get full text