Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Freund, Ari"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935--2004
Reuven Bar-Yehuda
,
Keren Bendel
,
Ari Freund
,
Dror Rawitz
ACM Computing Surveys
36
(4), 2004, pp. 422-463
Competitive on-line switching policies
Amotz Bar-Noy
,
Ari Freund
,
Shimon Landa
,
Joseph (Seffi) Naor
Algorithmica
36
(3), 2003, pp. 225-247
Algorithmic aspects of bandwidth trading
Randeep Bhatia
,
Julia Chuzhoy
,
Ari Freund
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
2719
, 2003, pp. 751-766
Approximating the advertisement placement problem
Ari Freund
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
2337
, 2002, pp. 415-424
A unified approach to approximating resource allocation and scheduling
Amotz Bar-Noy
,
Reuven Bar-Yehuda
,
Ari Freund
,
Joseph (Seffi) Naor
,
Baruch Schieber
Journal of the ACM
48
(5), 2001, pp. 1069-1090
On-line load balancing in a hierarchical server topology
Amotz Bar-Noy
,
Ari Freund
,
Joseph (Seffi) Naor
SIAM Journal on Computing
31
(2), 2001, pp. 527-549
A unified approach to approximating resource allocation and scheduling
Amotz Bar-Noy
,
Reuven Bar-Yehuda
,
Ari Freund
,
Joseph (Seffi) Naor
,
Baruch Schieber
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 735-744
A lower bound of
8/(7+\frac{1}{k-1}
on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut
Ari Freund
,
Howard Karloff
Information Processing Letters
75
(1-2), 2000, pp. 43-50
On-line load balancing in a hierarchical server topology
Amotz Bar-Noy
,
Ari Freund
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
1643
, 1999, pp. 77-88