Alon Noga

Noga Alon

Information about the author Noga Alon will soon be added to the site.
Found 6 papers in total
Strategyproof approximation of the minimax on networks
Strategyproof approximation of the minimax on networks
2010
We consider the problem of locating a facility on a network represented by a graph. A...
The Grothendieck constant of random and pseudo-random graphs
The Grothendieck constant of random and pseudo-random graphs
2008
The Grothendieck constant of a graph G=(V,E) is the least constant K such that for...
Separable partitions
Separable partitions
1999
An ordered partition of a set of n points in the d -dimensional Euclidean space is...
Approximation schemes for scheduling on parallel machines
Approximation schemes for scheduling on parallel machines
1998
We discuss scheduling problems with m identical machines and n jobs where each job has...
Approximating the independence number via the ϑ-function
Approximating the independence number via the ϑ-function
1998
We describe an approximation algorithm for the independence number of a graph. If a...
Transmitting in the n-dimensional cube
Transmitting in the n-dimensional cube
1992
Motivated by a certain communication problem the paper shows that for any integer n...
Papers per page: