Danny Segev - RankMe

96 papers A* 3A 7B 7C 1Journal 70Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A prophet inequality based approach to the adaptive ProbeTop$\varvec{K}$ problem. Math. Program. Guillermo Gallego, Danny Segev
2026	J	`jnl`	Approximation Schemes for Sequential Hiring Problems. CoRR Danny Segev, Uri Stein
2026	J	`jnl`	Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies. CoRR Danny Segev
2026	J	`jnl`	Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier. CoRR Danny Segev
2026	J	`jnl`	Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps. Oper. Res. Omar El Housni, Marouane Ibn Brahim, Danny Segev
2026	J	`jnl`	Resource-Constrained Joint Replenishment via Power-of-m CoRR Danny Segev
2025	J	`jnl`	Approximation Algorithms for Fair Repetitive Scheduling. CoRR Danny Hermelin, Danny Segev, Dvir Shabtay
2025	J	`jnl`	Dynamic Pricing with Menu Costs: Approximation Schemes and Applications to Grocery Retail. Manuf. Serv. Oper. Manag. Jacob B. Feldman, Danny Segev
2025	J	`jnl`	Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking. CoRR Danny Segev, Gidi Steinberg
2025	J	`jnl`	Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers. Oper. Res. Danny Segev
2025	J	`jnl`	Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time. CoRR Danny Segev
2025	J	`jnl`	New Approximation Guarantees for The Inventory Staggering Problem. CoRR Noga Alon, Danny Segev
2025	J	`jnl`	The Click-Based MNL Model: A Framework for Modeling Click Data in Assortment Optimization. Manag. Sci. Ali Aouad, Jacob B. Feldman, Danny Segev, Dennis J. Zhang
2025	J	`jnl`	The Continuous-Time Joint Replenishment Problem: Manag. Sci. Danny Segev
2024	J	`jnl`	Assortment Optimization Under the Multi-Purchase Multinomial Logit Choice Model. Oper. Res. Yicheng Bai, Jacob B. Feldman, Danny Segev, Huseyin Topaloglu, Laura Wagner
2024	J	`jnl`	Improved Approximation Guarantees for Joint Replenishment in Continuous Time. CoRR Danny Segev
2024	J	`jnl`	New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem. CoRR Danny Segev
2024	J	`jnl`	Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Math. Program. Alon Rieger, Danny Segev
2024	J	`jnl`	Revenue Maximization in Choice-Based Matching Markets. CoRR Dan Nissim, Danny Segev, Alfredo Torrico
2023	J	`jnl`	Approximation algorithms for the generalized incremental knapsack problem. Math. Program. Yuri Faenza, Danny Segev, Lingyi Zhang
2023	J	`jnl`	Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. Oper. Res. Ali Aouad, Danny Segev
2023	J	`jnl`	The Continuous-Time Joint Replenishment Problem: ε-Optimal Policies via Pairwise Alignment. CoRR Danny Segev
2023	J	`jnl`	The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? Manag. Sci. Ali Aouad, Jacob B. Feldman, Danny Segev
2023	J	`jnl`	The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications. Oper. Res. Ali Aouad, Danny Segev
2022	J	`jnl`	A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem. CoRR Guillermo Gallego, Danny Segev
2022	J	`jnl`	A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems. Oper. Res. Danny Segev, Yaron Shaposhnik
2022	J	`jnl`	Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers. CoRR Danny Segev
2022	J	`jnl`	Technical Note - Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model. Oper. Res. Danny Segev
2022	J	`jnl`	Technical Note - The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays. Oper. Res. Jacob B. Feldman, Danny Segev
2021	J	`jnl`	Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences. Manag. Sci. Ali Aouad, Danny Segev
2021	A*	`conf`	Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. EC Danny Segev, Sahil Singla
2021	J	`jnl`	Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice. Oper. Res. Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev
2020	J	`jnl`	An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. CoRR Ali Aouad, Danny Segev
2020	J	`jnl`	Approximation Algorithms for The Generalized Incremental Knapsack Problem. CoRR Yuri Faenza, Danny Segev, Lingyi Zhang
2020	J	`jnl`	Constrained Assortment Optimization Under the Markov Chain-based Choice Model. Manag. Sci. Antoine Désir, Vineet Goyal, Danny Segev, Chun Ye
2020	J	`jnl`	Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. CoRR Danny Segev, Sahil Singla
2020	J	`jnl`	The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Algorithmica Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev
2019	J	`jnl`	A polynomial-time approximation scheme for the airplane refueling problem. J. Sched. Iftah Gamzu, Danny Segev
2019	J	`jnl`	Approximation Algorithms for Dynamic Assortment Optimization Models. Math. Oper. Res. Ali Aouad, Retsef Levi, Danny Segev
2019	J	`jnl`	Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States? Algorithmica Danny Segev
2019	J	`jnl`	Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Algorithmica Niv Buchbinder, Danny Segev, Yevgeny Tkach
2019	J	`jnl`	Scheduling Promotion Vehicles to Boost Profits. Manag. Sci. Lennart Baardman, Maxime C. Cohen, Kiran Panchamgam, Georgia Perakis, Danny Segev
2019	J	`jnl`	The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. Ali Aouad, Danny Segev
2018	J	`jnl`	Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. Oper. Res. Ali Aouad, Retsef Levi, Danny Segev
2018	J	`jnl`	Improved bounds for randomized preemptive online matching. Inf. Comput. Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2018	J	`jnl`	The Approximability of Assortment Optimization Under Ranking Preferences. Oper. Res. Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev
2017	J	`jnl`	A Sublogarithmic Approximation for Tollbooth Pricing on Trees. Math. Oper. Res. Iftah Gamzu, Danny Segev
2017	A	`conf`	Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA Niv Buchbinder, Danny Segev, Yevgeny Tkach
2017	B	`conf`	The Approximability of Partial Vertex Covers in Trees. SOFSEM Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
2016	—	`conf`	Assortment Optimization Under the Mallows model. NIPS Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev
2016	A*	`conf`	Assortment Optimization under a Random Swap based Distribution over Permutations Model. EC Antoine Désir, Vineet Goyal, Danny Segev
2016	J	`jnl`	Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. Oper. Res. Vineet Goyal, Retsef Levi, Danny Segev
2015	J	`jnl`	A Polynomial-Time Approximation Scheme for The Airplane Refueling Problem. CoRR Iftah Gamzu, Danny Segev
2014	J	`jnl`	An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem. Math. Oper. Res. Danny Segev
2014	J	`jnl`	Mobile facility location: combinatorial filtering via weighted occupancy. J. Comb. Optim. Amitai Armon, Iftah Gamzu, Danny Segev
2013	J	`jnl`	Approximation algorithms for orienting mixed graphs. Theor. Comput. Sci. Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
2013	A	`conf`	Improved Bounds for Online Preemptive Matching. STACS Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2013	J	`jnl`	The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks. J. Comput. Biol. Dima Blokh, Danny Segev, Roded Sharan
2012	B	`conf`	Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. CPM Dima Blokh, Danny Segev, Roded Sharan
2012	J	`jnl`	Improved Bounds for Online Preemptive Matching CoRR Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2011	J	`jnl`	A Unified Approach to Approximating Partial Covering Problems. Algorithmica Jochen Könemann, Ojas Parekh, Danny Segev
2011	J	`jnl`	Approximating J. Comb. Optim. Danny Segev
2011	B	`conf`	Approximation Algorithms for Orienting Mixed Graphs. CPM Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
2011	J	`jnl`	Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discret. Math. Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2011	J	`jnl`	On the Approximability of Reachability-Preserving Network Orientations. Internet Math. Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan
2011	J	`jnl`	Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
2010	J	`jnl`	A Sublogarithmic Approximation for Highway and Tollbooth Pricing CoRR Iftah Gamzu, Danny Segev
2010	—	`conf`	A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) Iftah Gamzu, Danny Segev
2010	J	`jnl`	A polylogarithmic approximation for computing non-metric terminal Steiner trees. Inf. Process. Lett. Iftah Gamzu, Danny Segev
2010	J	`jnl`	Approximate Algorithmica Danny Segev, Gil Segev
2010	A	`conf`	Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2010	C	`conf`	Improved Orientations of Physical Networks. WABI Iftah Gamzu, Danny Segev, Roded Sharan
2010	J	`jnl`	The Complexity of Bottleneck Labeled Graph Problems. Algorithmica Refael Hassin, Jérôme Monnot, Danny Segev
2009	J	`jnl`	Improved approximation guarantees for weighted matching in the semi-streaming model CoRR Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2009	J	`jnl`	Improved online algorithms for the sorting buffer problem on line metrics. ACM Trans. Algorithms Iftah Gamzu, Danny Segev
2009	J	`jnl`	Scheduling with Outliers CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
2009	—	`conf`	Scheduling with Outliers. APPROX-RANDOM Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
2008	J	`jnl`	Path Hitting in Acyclic Graphs. Algorithmica Ojas Parekh, Danny Segev
2008	J	`jnl`	Rounding to an integral program. Oper. Res. Lett. Refael Hassin, Danny Segev
2008	A*	`conf`	Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
2007	J	`jnl`	Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. Refael Hassin, Jérôme Monnot, Danny Segev
2007	—	`—`	Approximation algorithms for NP-hard problems in combinatorial optimization Danny Segev
2007	—	`conf`	Bi-criteria linear-time approximations for generalized k-mean/median/center. SCG Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
2007	A	`conf`	Improved Online Algorithms for the Sorting Buffer Problem. STACS Iftah Gamzu, Danny Segev
2007	B	`conf`	The Complexity of Bottleneck Labeled Graph Problems. WG Refael Hassin, Jérôme Monnot, Danny Segev
2006	A	`conf`	A Unified Approach to Approximating Partial Covering Problems. ESA Jochen Könemann, Ojas Parekh, Danny Segev
2006	A	`conf`	Approximate ESA Danny Segev, Gil Segev
2006	B	`conf`	Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS Refael Hassin, Jérôme Monnot, Danny Segev
2006	J	`jnl`	Partial multicuts in trees. Theor. Comput. Sci. Asaf Levin, Danny Segev
2006	A	`conf`	Path Hitting in Acyclic Graphs. ESA Ojas Parekh, Danny Segev
2006	J	`jnl`	Robust subgraphs for trees and paths. ACM Trans. Algorithms Refael Hassin, Danny Segev
2005	B	`conf`	Partial Multicuts in Trees. WAOA Asaf Levin, Danny Segev
2005	—	`conf`	Rounding to an Integral Program. WEA Refael Hassin, Danny Segev
2005	B	`conf`	The Multi-radius Cover Problem. WADS Refael Hassin, Danny Segev
2005	—	`conf`	The Set Cover with Pairs Problem. FSTTCS Refael Hassin, Danny Segev
2004	—	`conf`	Robust Subgraphs for Trees and Paths. SWAT Refael Hassin, Danny Segev