Reuven Bar-Yehuda

Publication Activity (10 Years)

Years Active: 1981-2020
Publications (10 Years): 10

Top Topics

Constant Factor Approximation Algorithm

Communication Cost

Top Venues

Discret. Appl. Math.

IEEE Trans. Mob. Comput.

Publications

Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju
Distributed Approximation on Power Graphs. PODC (2020)
Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju
Distributed Approximation on Power Graphs. CoRR (2020)
Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks. SIAM J. Discret. Math. 32 (3) (2018)
Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz
1.5-approximation algorithm for the 2-Convex Recoloring problem. Discret. Appl. Math. 246 (2018)
Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR (2017)
Reuven Bar-Yehuda, Michael Beder, Dror Rawitz
A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Algorithmica 77 (4) (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. J. ACM 64 (3) (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. PODC (2016)
Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman
A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds. CoRR (2016)
Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz
Bandwidth allocation in cellular networks with multiple interferences. Discret. Appl. Math. 194 (2015)
Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. IWOCA (2015)
Ann Becker, Reuven Bar-Yehuda, Dan Geiger
Random Algorithms for the Loop Cutset Problem. CoRR (2014)
Reuven Bar-Yehuda, Michael Beder, Dror Rawitz
A constant factor approximation algorithm for the storage allocation problem: extended abstract. SPAA (2013)
David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub
Cell Selection in 4G Cellular Networks. IEEE Trans. Mob. Comput. 12 (7) (2013)
Reuven Bar-Yehuda, Dror Rawitz
A note on multicovering with disks. Comput. Geom. 46 (3) (2013)
Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. ICALP (2) (2012)
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
Minimum vertex cover in rectangle graphs. Comput. Geom. 44 (6-7) (2011)
Reuven Bar-Yehuda, Ann Becker, Dan Geiger
Randomized Algorithms for the Loop Cutset Problem CoRR (2011)
Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz
Bandwidth allocation in cellular networks with multiple interferences. DIALM-PODC (2010)
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discret. Math. 24 (1) (2010)
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
Minimum Vertex Cover in Rectangle Graphs. ESA (1) (2010)
Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
Approximation of Partial Capacitated Vertex Cover. SIAM J. Discret. Math. 24 (4) (2010)
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
Minimum Vertex Cover in Rectangle Graphs CoRR (2010)
Ron Zohar, Reuven Bar-Yehuda
The maximum weight hierarchy matching problem. Inf. Fusion 10 (2) (2009)
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA (2009)
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
Resource Allocation in Bounded Degree Trees. Algorithmica 54 (1) (2009)
David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub
Cell Selection in 4G Cellular Networks. INFOCOM (2008)
Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz
Improved Approximation Algorithm for Convex Recoloring of Trees. Theory Comput. Syst. 43 (1) (2008)
Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz
Approximation of Partial Capacitated Vertex Cover. ESA (2007)
Reuven Bar-Yehuda, Jonathan Laserson
Exploiting locality: approximating sorting buffers. J. Discrete Algorithms 5 (4) (2007)
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
Resource Allocation in Bounded Degree Trees. ESA (2006)
Reuven Bar-Yehuda, Dror Rawitz
Using fractional primal-dual to schedule split intervals with demands. Discret. Optim. 3 (4) (2006)
Reuven Bar-Yehuda, Irad Yavneh
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping. J. Graph Algorithms Appl. 10 (2) (2006)
Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
Scheduling Split Intervals. SIAM J. Comput. 36 (1) (2006)
Reuven Bar-Yehuda, Dror Rawitz
A Tale of Two Methods. Essays in Memory of Shimon Even (2006)
Reuven Bar-Yehuda, Guy Even, Shimon Shahar
On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms 55 (1) (2005)
Reuven Bar-Yehuda, Jonathan Laserson
Exploiting Locality: Approximating Sorting Buffers. WAOA (2005)
Reuven Bar-Yehuda, Dror Rawitz
Using Fractional Primal-Dual to Schedule Split Intervals with Demands. ESA (2005)
Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz
Improved Approximation Algorithm for Convex Recoloring of Trees. WAOA (2005)
Reuven Bar-Yehuda, Dror Rawitz
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique. SIAM J. Discret. Math. 19 (3) (2005)
Reuven Bar-Yehuda, Keren Bendel, Ari Freund, Dror Rawitz
Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004. ACM Comput. Surv. 36 (4) (2004)
Reuven Bar-Yehuda, Zehavit Kehat
Approximating the dense set-cover problem. J. Comput. Syst. Sci. 69 (4) (2004)
Reuven Bar-Yehuda, Dror Rawitz
Local ratio with negative weights. Oper. Res. Lett. 32 (6) (2004)
Reuven Bar-Yehuda, Guy Even, Shimon Shahar
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. ESA (2003)
Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
Scheduling split intervals. SODA (2002)
Reuven Bar-Yehuda, Dror Rawitz
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. J. Algorithms 42 (1) (2002)
Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
A unified approach to approximating resource allocation and scheduling. J. ACM 48 (5) (2001)
Reuven Bar-Yehuda, Dror Rawitz
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique. RANDOM-APPROX (2001)
Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. J. Graph Algorithms Appl. 5 (4) (2001)
Reuven Bar-Yehuda
Using Homogeneous Weights for Approximating the Partial Cover Problem. J. Algorithms 39 (2) (2001)
Reuven Bar-Yehuda, Dror Rawitz
Efficient Algorithms for Integer Programs with Two Variables per Constraint. Algorithmica 29 (4) (2001)
Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
A unified approach to approximating resource allocation and scheduling. STOC (2000)
Ann Becker, Reuven Bar-Yehuda, Dan Geiger
Randomized Algorithms for the Loop Cutset Problem. J. Artif. Intell. Res. 12 (2000)
Reuven Bar-Yehuda
One for the Price of Two: a Unified Approach for Approximating Covering Problems. Algorithmica 27 (2) (2000)
Reuven Bar-Yehuda, Dror Rawitz
Efficient Algorithms for Integer Programs with Two Variables per Constraint. ESA (1999)
Reuven Bar-Yehuda
Using Homogenous Weights for Approximating the Partial Cover Problem. SODA (1999)
Ann Becker, Reuven Bar-Yehuda, Dan Geiger
Random Algorithms for the Loop Cutset Problem. UAI (1999)
Yohai Makbily, Craig Gotsman, Reuven Bar-Yehuda
Geometric algorithms for message filtering in decentralized virtual environments. SI3D (1999)
Reuven Bar-Yehuda, Sergio Fogel
Partitioning a Sequence into Few Monotone Subsequences. Acta Informatica 35 (5) (1998)
Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput. 27 (4) (1998)
Reuven Bar-Yehuda
One for the Price of Two: A Unified Approach for Approximating Covering Problems. APPROX (1998)
Shmuel Cohen, Gershon Elber, Reuven Bar-Yehuda
Matching of freeform curves. Comput. Aided Des. 29 (5) (1997)
Reuven Bar-Yehuda, E. Ben-Hanoch
A linear time algorithm for covering simple polygons with similar rectangles. Int. J. Comput. Geom. Appl. 6 (1) (1996)
Reuven Bar-Yehuda, Craig Gotsman
Time/Space Tradeoffs for Polygon Mesh Rendering. ACM Trans. Graph. 15 (2) (1996)
Reuven Bar-Yehuda, Bernard Chazelle
Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. 4 (4) (1994)
Reuven Bar-Yehuda, Sergio Fogel
Variations on Ray Shooting. Algorithmica 11 (2) (1994)
Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SODA (1994)
Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran
Rotating-Table Games and Derivatives of Words. Theor. Comput. Sci. 108 (2) (1993)
Reuven Bar-Yehuda, Amos Israeli, Alon Itai
Multiple Communication in Multihop Radio Networks. SIAM J. Comput. 22 (4) (1993)
Reuven Bar-Yehuda, Alon Efrat, Alon Itai
A Simple Algorithm for Maintaining the Center of a Planar Point-set. CCCG (1993)
Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
Privacy, additional information and communication. IEEE Trans. Inf. Theory 39 (6) (1993)
Reuven Bar-Yehuda, Tuvi Etzion
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. Discret. Appl. Math. (1992)
Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. Comput. Syst. Sci. 45 (1) (1992)
Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. Distributed Comput. 5 (1991)
Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz
Privacy, Additional Information, and Communication. Computational Complexity Conference (1990)
Reuven Bar-Yehuda, Amos Israeli
Multiple Communication in Multi-Hop Radio Networks. PODC (1989)
Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. WDAG (1989)
Reuven Bar-Yehuda, Jack A. Feldman, Ron Y. Pinter, Shmuel Wimer
Depth-first-search and dynamic programming algorithms for efficient CMOS cell generation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8 (7) (1989)
Reuven Bar-Yehuda, Shay Kutten
Fault Tolerant Distributed Majority Commitment. J. Algorithms 9 (4) (1988)
Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
Making Distributed Spanning Tree Algorithms Fault-Resilient. STACS (1987)
Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. PODC (1987)
Reuven Bar-Yehuda, Shlomo Moran
On approximation problems related to the independent set and vertex cover problems. Discret. Appl. Math. 9 (1) (1984)
Reuven Bar-Yehuda, Shimon Even
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. WG (1983)
Reuven Bar-Yehuda, Shimon Even
On Approximating a Vertex Cover for Planar Graphs STOC (1982)
Reuven Bar-Yehuda, Uzi Vishkin
Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett. 14 (5) (1982)
Reuven Bar-Yehuda, Shimon Even
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. J. Algorithms 2 (2) (1981)