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
[2]
Hilfe
Suche: Author="Bar-Yehuda, Reuven"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A constant factor approximation algorithm for the storage allocation problem
Reuven Bar-Yehuda
,
Michael Beder
,
Dror Rawitz
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 204-213
Growing half-balls: Minimizing storage and communication costs in CDNs
Reuven Bar-Yehuda
,
Erez Kantor
,
Shay Kutten
,
Dror Rawitz
Lecture Notes in Computer Science
7392
, 2012, pp. 416-427
Approximation of partial capacitated vertex cover
Reuven Bar-Yehuda
,
Guy Flysher
,
Julián Mestre
,
Dror Rawitz
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1441-1469
Minimum vertex cover in rectangle graphs
Reuven Bar-Yehuda
,
Danny Hermelin
,
Dror Rawitz
Lecture Notes in Computer Science
6346
, 2010, pp. 255-266
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications
Reuven Bar-Yehuda
,
Danny Hermelin
,
Dror Rawitz
SIAM Journal on Discrete Mathematics
24
(1), 2010, pp. 287-300
Resource allocation in bounded degree trees
Reuven Bar-Yehuda
,
Michael Beder
,
Yuval Cohen
,
Dror Rawitz
Algorithmica
54
(1), 2009, pp. 89-106
Improved approximation algorithm for convex recoloring of trees
Reuven Bar-Yehuda
,
Ido Feldman
,
Dror Rawitz
Theory of Computing Systems
43
(1), 2008, pp. 3-18
Approximation of partial capacitated vertex cover
Reuven Bar-Yehuda
,
Guy Flysher
,
Julián Mestre
,
Dror Rawitz
Lecture Notes in Computer Science
4698
, 2007, pp. 335-346
Resource allocation in bounded degree trees
Reuven Bar-Yehuda
,
Michael Beder
,
Yuval Cohen
,
Dror Rawitz
Lecture Notes in Computer Science
4168
, 2006, pp. 64-75
On approximating a geometric prize-collecting Traveling Salesman problem with time windows
Reuven Bar-Yehuda
,
Guy Even
,
Shimon (Moni) Shahar
Journal of Algorithms
55
(1), 2005, pp. 76-92
Using fractional primal-dual to schedule split intervals with demands
Reuven Bar-Yehuda
,
Dror Rawitz
Lecture Notes in Computer Science
3669
, 2005, pp. 714-725
On the equivalence between the primal-dual schema and the local ratio technique
Reuven Bar-Yehuda
,
Dror Rawitz
SIAM Journal on Discrete Mathematics
19
(3), 2005, pp. 762-797
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
Approximating the dense set-cover problem
Reuven Bar-Yehuda
,
Zehavit Kehat
Journal of Computer and System Sciences
69
(4), 2004, pp. 547-561
On approximating a geometric prize-collecting Traveling Salesman Problem with time windows
Reuven Bar-Yehuda
,
Guy Even
,
Shimon (Moni) Shahar
Lecture Notes in Computer Science
2832
, 2003, pp. 55-66
Approximating element-weighted vertex deletion problems for the complete
k
-partite property
Reuven Bar-Yehuda
,
Dror Rawitz
Journal of Algorithms
42
(1), 2002, pp. 20-40
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
Using homogeneous weights for approximating the partial cover problem
Reuven Bar-Yehuda
Journal of Algorithms
39
(2), 2001, pp. 137-144
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
Efficient algorithms for integer programs with two variables per constraint
Reuven Bar-Yehuda
,
Dror Rawitz
Lecture Notes in Computer Science
1643
, 1999, pp. 116-126
Using homogenous weights for approximating the partial cover problem
Reuven Bar-Yehuda
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 71-75
Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
Reuven Bar-Yehuda
,
Dan Geiger
,
Joseph (Seffi) Naor
,
Ron M. Roth
SIAM Journal on Computing
27
(4), 1998, pp. 942-959
One for the price of two: A unified approach for approximating covering problems
Reuven Bar-Yehuda
Lecture Notes in Computer Science
1444
, 1998, pp. 49-62
Variations on ray shooting
Reuven Bar-Yehuda
,
Sergio Fogel
Algorithmica
11
, 1994, pp. 133-145
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference
Reuven Bar-Yehuda
,
Dan Geiger
,
Joseph (Seffi) Naor
,
Ron M. Roth
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 344-354
Seiten 1
2
>