Balanced Allocations
- Y. Azar, A. Broder, Anna R. Karlin, E. Upfal
- MathematicsSIAM journal on computing (Print)
- 1 September 1999
It is shown that with high probability, the fullest box contains only ln ln n/ln 2 + O(1) balls---exponentially less than before and a similar gap exists in the infinite process, where at each step one ball, chosen uniformly at random, is deleted, and one ball is added in the manner above.
The Price of Routing Unsplittable Flow
- B. Awerbuch, Y. Azar, Amir Epstein
- Computer ScienceSymposium on the Theory of Computing
- 22 May 2005
This paper assumes this more realistic unsplittable model, and investigates the "price of anarchy", or deterioration of network performance measured in total traffic latency under the selfish user behavior, showing that for linear edge latency functions the price of anarchy is exactly $2.618 for weighted demand and exactly$2.5 for unweighted demand.
On-line routing of virtual circuits with applications to load balancing and machine scheduling
- J. Aspnes, Y. Azar, A. Fiat, Serge A. Plotkin, Orli Waarts
- Computer ScienceJACM
- 1 May 1997
An algorithm is described that achieves on-line allocation of routes to virtual circuits (both point-to-point and multicast) with a constant competitive ratio with respect to maximum congestin, where n is the number of nodes in the network.
The competitiveness of on-line assignments
- Y. Azar, J. Naor, R. Rom
- Mathematics, Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 1 September 1992
It is concluded that for the on-line problem where a number of servers are ready to provide service to a set of customers, randomized algorithms differ from deterministic ones by precisely a constant factor.
The online set cover problem
- N. Alon, B. Awerbuch, Y. Azar, Niv Buchbinder, J. Naor
- Computer ScienceSymposium on the Theory of Computing
- 9 June 2003
An O(log n log m/log log m + log log n) competitive deterministic algorithm for the set cover problem is presented, and a nearly matching lower bound for all interesting values of m and n is established.
Buy-at-bulk network design
- B. Awerbuch, Y. Azar
- Computer ScienceProceedings 38th Annual Symposium on Foundations…
- 19 October 1997
O(log/sup 2/n) randomized approximation algorithm is provided for the buy-at-bulk network design problem, solving the open problem and solving additional natural variations of the problem, such as multi-sink network design, as well as selective network design.
A general approach to online network optimization problems
- N. Alon, B. Awerbuch, Y. Azar, Niv Buchbinder, J. Naor
- Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 11 January 2004
These algorithms are based on a unified framework for designing online algorithms for problems involving connectivity and cuts, and present a deterministic algorithm for generating fractional solution that satisfies the online connectivity or cut demands, where m is the number of edges in the graph.
Throughput-competitive on-line routing
- B. Awerbuch, Y. Azar, Serge A. Plotkin
- Computer ScienceProceedings of IEEE 34th Annual Foundations of…
- 3 November 1993
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to…
Spectral analysis of data
- Y. Azar, A. Fiat, Anna R. Karlin, Frank McSherry, Jared Saia
- Computer ScienceSymposium on the Theory of Computing
- 6 July 2001
A model for framing data mining tasks and a unified approach to solving the resulting data mining problems using spectral analysis are presented, which give strong justification to the use of spectral techniques for latent semantic indexing, collaborative filtering, and web site ranking.
...
...