Danny Segev

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 33

Top Topics

Maximum Cardinality

Multinomial Logit

Knapsack Problem

Approximation Algorithms

Top Venues

Math. Oper. Res.

Publications

Ali Aouad, Danny Segev
The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications. Oper. Res. 71 (4) (2023)
Danny Segev
The Continuous-Time Joint Replenishment Problem: ε-Optimal Policies via Pairwise Alignment. CoRR (2023)
Yuri Faenza, Danny Segev, Lingyi Zhang
Approximation algorithms for the generalized incremental knapsack problem. Math. Program. 198 (1) (2023)
Ali Aouad, Jacob B. Feldman, Danny Segev
The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? Manag. Sci. 69 (5) (2023)
Ali Aouad, Danny Segev
Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. Oper. Res. 71 (4) (2023)
Danny Segev
Technical Note - Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model. Oper. Res. 70 (5) (2022)
Danny Segev, Yaron Shaposhnik
A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems. Oper. Res. 70 (2) (2022)
Jacob B. Feldman, Danny Segev
Technical Note - The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays. Oper. Res. 70 (4) (2022)
Guillermo Gallego, Danny Segev
A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem. CoRR (2022)
Danny Segev
Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers. CoRR (2022)
Ali Aouad, Danny Segev
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences. Manag. Sci. 67 (6) (2021)
Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice. Oper. Res. 69 (4) (2021)
Danny Segev, Sahil Singla
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. EC (2021)
Danny Segev, Sahil Singla
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. CoRR (2020)
Ali Aouad, Danny Segev
An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. CoRR (2020)
Antoine Désir, Vineet Goyal, Danny Segev, Chun Ye
Constrained Assortment Optimization Under the Markov Chain-based Choice Model. Manag. Sci. 66 (2) (2020)
Yuri Faenza, Danny Segev, Lingyi Zhang
Approximation Algorithms for The Generalized Incremental Knapsack Problem. CoRR (2020)
Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Algorithmica 82 (9) (2020)
Iftah Gamzu, Danny Segev
A polynomial-time approximation scheme for the airplane refueling problem. J. Sched. 22 (1) (2019)
Ali Aouad, Danny Segev
The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. 177 (1-2) (2019)
Lennart Baardman, Maxime C. Cohen, Kiran Panchamgam, Georgia Perakis, Danny Segev
Scheduling Promotion Vehicles to Boost Profits. Manag. Sci. 65 (1) (2019)
Danny Segev
Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States? Algorithmica 81 (1) (2019)
Niv Buchbinder, Danny Segev, Yevgeny Tkach
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Algorithmica 81 (5) (2019)
Ali Aouad, Retsef Levi, Danny Segev
Approximation Algorithms for Dynamic Assortment Optimization Models. Math. Oper. Res. 44 (2) (2019)
Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev
The Approximability of Assortment Optimization Under Ranking Preferences. Oper. Res. 66 (6) (2018)
Ali Aouad, Retsef Levi, Danny Segev
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. Oper. Res. 66 (5) (2018)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved bounds for randomized preemptive online matching. Inf. Comput. 259 (1) (2018)
Iftah Gamzu, Danny Segev
A Sublogarithmic Approximation for Tollbooth Pricing on Trees. Math. Oper. Res. 42 (2) (2017)
Niv Buchbinder, Danny Segev, Yevgeny Tkach
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA (2017)
Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
The Approximability of Partial Vertex Covers in Trees. SOFSEM (2017)
Vineet Goyal, Retsef Levi, Danny Segev
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. Oper. Res. 64 (1) (2016)
Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev
Assortment Optimization Under the Mallows model. NIPS (2016)
Antoine Désir, Vineet Goyal, Danny Segev
Assortment Optimization under a Random Swap based Distribution over Permutations Model. EC (2016)
Iftah Gamzu, Danny Segev
A Polynomial-Time Approximation Scheme for The Airplane Refueling Problem. CoRR (2015)
Danny Segev
An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem. Math. Oper. Res. 39 (2) (2014)
Amitai Armon, Iftah Gamzu, Danny Segev
Mobile facility location: combinatorial filtering via weighted occupancy. J. Comb. Optim. 28 (2) (2014)
Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
Approximation algorithms for orienting mixed graphs. Theor. Comput. Sci. 483 (2013)
Dima Blokh, Danny Segev, Roded Sharan
The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks. J. Comput. Biol. 20 (12) (2013)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved Bounds for Online Preemptive Matching. STACS (2013)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved Bounds for Online Preemptive Matching CoRR (2012)
Dima Blokh, Danny Segev, Roded Sharan
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. CPM (2012)
Jochen Könemann, Ojas Parekh, Danny Segev
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59 (4) (2011)
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discret. Math. 25 (3) (2011)
Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan
On the Approximability of Reachability-Preserving Network Orientations. Internet Math. 7 (4) (2011)
Danny Segev
-generalized connectivity via collapsing HSTs. J. Comb. Optim. 21 (3) (2011)
Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms 7 (2) (2011)
Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
Approximation Algorithms for Orienting Mixed Graphs. CPM (2011)
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS (2010)
Iftah Gamzu, Danny Segev, Roded Sharan
Improved Orientations of Physical Networks. WABI (2010)
Iftah Gamzu, Danny Segev
A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) (2010)
Iftah Gamzu, Danny Segev
A polylogarithmic approximation for computing non-metric terminal Steiner trees. Inf. Process. Lett. 110 (18-19) (2010)
Refael Hassin, Jérôme Monnot, Danny Segev
The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58 (2) (2010)
Iftah Gamzu, Danny Segev
A Sublogarithmic Approximation for Highway and Tollbooth Pricing CoRR (2010)
Danny Segev, Gil Segev
-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica 56 (4) (2010)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
Scheduling with Outliers. APPROX-RANDOM (2009)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
Scheduling with Outliers CoRR (2009)
Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
Improved approximation guarantees for weighted matching in the semi-streaming model CoRR (2009)
Iftah Gamzu, Danny Segev
Improved online algorithms for the sorting buffer problem on line metrics. ACM Trans. Algorithms 6 (1) (2009)
Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA (2008)
Refael Hassin, Danny Segev
Rounding to an integral program. Oper. Res. Lett. 36 (3) (2008)
Ojas Parekh, Danny Segev
Path Hitting in Acyclic Graphs. Algorithmica 52 (4) (2008)
Refael Hassin, Jérôme Monnot, Danny Segev
The Complexity of Bottleneck Labeled Graph Problems. WG (2007)
Refael Hassin, Jérôme Monnot, Danny Segev
Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14 (4) (2007)
Iftah Gamzu, Danny Segev
Improved Online Algorithms for the Sorting Buffer Problem. STACS (2007)
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
Bi-criteria linear-time approximations for generalized k-mean/median/center. SCG (2007)
Asaf Levin, Danny Segev
Partial multicuts in trees. Theor. Comput. Sci. 369 (1-3) (2006)
Refael Hassin, Danny Segev
Robust subgraphs for trees and paths. ACM Trans. Algorithms 2 (2) (2006)
Refael Hassin, Jérôme Monnot, Danny Segev
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS (2006)
Jochen Könemann, Ojas Parekh, Danny Segev
A Unified Approach to Approximating Partial Covering Problems. ESA (2006)
Ojas Parekh, Danny Segev
Path Hitting in Acyclic Graphs. ESA (2006)
Danny Segev, Gil Segev
-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. ESA (2006)
Refael Hassin, Danny Segev
The Set Cover with Pairs Problem. FSTTCS (2005)
Refael Hassin, Danny Segev
Rounding to an Integral Program. WEA (2005)
Refael Hassin, Danny Segev
The Multi-radius Cover Problem. WADS (2005)
Asaf Levin, Danny Segev
Partial Multicuts in Trees. WAOA (2005)
Refael Hassin, Danny Segev
Robust Subgraphs for Trees and Paths. SWAT (2004)