Fast approximate graph partitioning algorithms
- Guy Even
- Joseph Naor
- et al.
- 1999
- SIAM Journal on Computing
Paper
Publications
37 results for Joseph Naor
Approximating minimum feedback sets and multicuts in directed graphs
- G. Even
- J. Naor
- et al.
- 1998
- Algorithmica (New York)
PaperTight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Dorit S. Hochbaum
- Nimrod Megiddo
- et al.
- 1993
- Mathematical Programming
PaperThe greedy algorithm is optimal for on-line edge coloring
- Amotz Bar-Noy
- Rajeev Motwani
- et al.
- 1992
- Information Processing Letters
PaperConstruction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Noga Alon
- Jehoshua Bruck
- et al.
- 1992
- IEEE Trans. Inf. Theory
PaperConstruction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Noga Alon
- Jehoshua Bruck
- et al.
- 1991
- ISIT 1991
Conference paperOne-bit algorithms
- Amotz Bar-Noy
- Joseph Naor
- et al.
- 1990
- Distributed Computing
Paper