default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanny Segev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Alon Rieger, Danny Segev
:
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Math. Program. 208(1): 111-171 (2024)- [i12]Danny Segev:
Improved Approximation Guarantees for Joint Replenishment in Continuous Time. CoRR abs/2408.05443 (2024) - 2023
- [j40]Ali Aouad, Danny Segev:
The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications. Oper. Res. 71(4): 1216-1249 (2023) - [j39]Ali Aouad, Danny Segev:
Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. Oper. Res. 71(4): 1414-1433 (2023) - [j38]Ali Aouad, Jacob B. Feldman, Danny Segev:
The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? Manag. Sci. 69(5): 2814-2832 (2023) - [j37]Yuri Faenza, Danny Segev, Lingyi Zhang:
Approximation algorithms for the generalized incremental knapsack problem. Math. Program. 198(1): 27-83 (2023) - [i11]Danny Segev:
The Continuous-Time Joint Replenishment Problem: ε-Optimal Policies via Pairwise Alignment. CoRR abs/2302.09941 (2023) - 2022
- [j36]Danny Segev, Yaron Shaposhnik:
A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems. Oper. Res. 70(2): 1153-1165 (2022) - [j35]Jacob B. Feldman, Danny Segev:
Technical Note - The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays. Oper. Res. 70(4): 2162-2184 (2022) - [j34]Danny Segev:
Technical Note - Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model. Oper. Res. 70(5): 2820-2836 (2022) - [i10]Danny Segev:
Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers. CoRR abs/2209.13878 (2022) - [i9]Guillermo Gallego, Danny Segev:
A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem. CoRR abs/2210.07556 (2022) - 2021
- [j33]Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev:
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice. Oper. Res. 69(4): 1206-1227 (2021) - [j32]Ali Aouad, Danny Segev:
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences. Manag. Sci. 67(6): 3519-3550 (2021) - [c25]Danny Segev, Sahil Singla:
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. EC 2021: 793-794 - 2020
- [j31]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): 2474-2501 (2020) - [j30]Antoine Désir, Vineet Goyal, Danny Segev, Chun Ye:
Constrained Assortment Optimization Under the Markov Chain-based Choice Model. Manag. Sci. 66(2): 698-721 (2020) - [i8]Danny Segev, Sahil Singla:
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. CoRR abs/2007.13121 (2020) - [i7]Yuri Faenza, Danny Segev, Lingyi Zhang:
Approximation Algorithms for The Generalized Incremental Knapsack Problem. CoRR abs/2009.07248 (2020) - [i6]Ali Aouad, Danny Segev:
An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. CoRR abs/2010.07633 (2020)
2010 – 2019
- 2019
- [j29]Danny Segev:
Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States? Algorithmica 81(1): 393-417 (2019) - [j28]Niv Buchbinder, Danny Segev, Yevgeny Tkach:
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Algorithmica 81(5): 1781-1799 (2019) - [j27]Lennart Baardman, Maxime C. Cohen, Kiran Panchamgam, Georgia Perakis, Danny Segev:
Scheduling Promotion Vehicles to Boost Profits. Manag. Sci. 65(1): 50-70 (2019) - [j26]Ali Aouad, Retsef Levi, Danny Segev:
Approximation Algorithms for Dynamic Assortment Optimization Models. Math. Oper. Res. 44(2): 487-511 (2019) - [j25]Ali Aouad, Danny Segev:
The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. 177(1-2): 55-83 (2019) - [j24]Iftah Gamzu, Danny Segev:
A polynomial-time approximation scheme for the airplane refueling problem. J. Sched. 22(1): 119-135 (2019) - 2018
- [j23]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved bounds for randomized preemptive online matching. Inf. Comput. 259(1): 31-40 (2018) - [j22]Ali Aouad, Retsef Levi, Danny Segev:
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. Oper. Res. 66(5): 1321-1345 (2018) - [j21]Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev:
The Approximability of Assortment Optimization Under Ranking Preferences. Oper. Res. 66(6): 1661-1669 (2018) - 2017
- [j20]Iftah Gamzu, Danny Segev:
A Sublogarithmic Approximation for Tollbooth Pricing on Trees. Math. Oper. Res. 42(2): 377-388 (2017) - [c24]Niv Buchbinder, Danny Segev, Yevgeny Tkach:
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA 2017: 22:1-22:14 - [c23]Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani:
The Approximability of Partial Vertex Covers in Trees. SOFSEM 2017: 350-360 - 2016
- [j19]Vineet Goyal, Retsef Levi, Danny Segev:
Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. Oper. Res. 64(1): 219-235 (2016) - [c22]Antoine Désir, Vineet Goyal, Srikanth Jagabathula, Danny Segev:
Assortment Optimization Under the Mallows model. NIPS 2016: 4700-4708 - [c21]Antoine Désir, Vineet Goyal, Danny Segev:
Assortment Optimization under a Random Swap based Distribution over Permutations Model. EC 2016: 341-342 - 2015
- [i5]Iftah Gamzu, Danny Segev:
A Polynomial-Time Approximation Scheme for The Airplane Refueling Problem. CoRR abs/1512.06353 (2015) - 2014
- [j18]Amitai Armon, Iftah Gamzu, Danny Segev:
Mobile facility location: combinatorial filtering via weighted occupancy. J. Comb. Optim. 28(2): 358-375 (2014) - [j17]Danny Segev:
An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem. Math. Oper. Res. 39(2): 432-444 (2014) - 2013
- [j16]Dima Blokh, Danny Segev, Roded Sharan:
The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks. J. Comput. Biol. 20(12): 945-957 (2013) - [j15]Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan:
Approximation algorithms for orienting mixed graphs. Theor. Comput. Sci. 483: 96-103 (2013) - [c20]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399 - 2012
- [c19]Dima Blokh, Danny Segev, Roded Sharan:
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. CPM 2012: 70-82 - [i4]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012) - 2011
- [j14]Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011) - [j13]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): 209-232 (2011) - [j12]Danny Segev:
Approximating k-generalized connectivity via collapsing HSTs. J. Comb. Optim. 21(3): 364-382 (2011) - [j11]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): 1251-1265 (2011) - [j10]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): 18:1-18:17 (2011) - [c18]Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan:
Approximation Algorithms for Orienting Mixed Graphs. CPM 2011: 416-428 - 2010
- [j9]Danny Segev, Gil Segev:
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica 56(4): 529-549 (2010) - [j8]Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010) - [j7]Iftah Gamzu, Danny Segev:
A polylogarithmic approximation for computing non-metric terminal Steiner trees. Inf. Process. Lett. 110(18-19): 826-829 (2010) - [c17]Iftah Gamzu, Danny Segev:
A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) 2010: 582-593 - [c16]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358 - [c15]Iftah Gamzu, Danny Segev, Roded Sharan:
Improved Orientations of Physical Networks. WABI 2010: 215-225 - [i3]Iftah Gamzu, Danny Segev:
A Sublogarithmic Approximation for Highway and Tollbooth Pricing. CoRR abs/1002.2084 (2010)
2000 – 2009
- 2009
- [j6]Iftah Gamzu, Danny Segev:
Improved online algorithms for the sorting buffer problem on line metrics. ACM Trans. Algorithms 6(1): 15:1-15:14 (2009) - [c14]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev:
Scheduling with Outliers. APPROX-RANDOM 2009: 149-162 - [i2]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev:
Scheduling with Outliers. CoRR abs/0906.2020 (2009) - [i1]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
Improved approximation guarantees for weighted matching in the semi-streaming model. CoRR abs/0907.0305 (2009) - 2008
- [j5]Ojas Parekh, Danny Segev:
Path Hitting in Acyclic Graphs. Algorithmica 52(4): 466-486 (2008) - [j4]Refael Hassin, Danny Segev:
Rounding to an integral program. Oper. Res. Lett. 36(3): 321-326 (2008) - [c13]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541 - 2007
- [b1]Danny Segev:
Approximation algorithms for NP-hard problems in combinatorial optimization. Tel Aviv University, Israel, 2007 - [j3]Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007) - [c12]Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev:
Bi-criteria linear-time approximations for generalized k-mean/median/center. SCG 2007: 19-26 - [c11]Iftah Gamzu, Danny Segev:
Improved Online Algorithms for the Sorting Buffer Problem. STACS 2007: 658-669 - [c10]Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 - 2006
- [j2]Refael Hassin, Danny Segev:
Robust subgraphs for trees and paths. ACM Trans. Algorithms 2(2): 263-281 (2006) - [j1]Asaf Levin, Danny Segev:
Partial multicuts in trees. Theor. Comput. Sci. 369(1-3): 384-395 (2006) - [c9]Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479 - [c8]Ojas Parekh, Danny Segev:
Path Hitting in Acyclic Graphs. ESA 2006: 564-575 - [c7]Danny Segev, Gil Segev:
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. ESA 2006: 600-611 - [c6]Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491 - 2005
- [c5]Refael Hassin, Danny Segev:
The Set Cover with Pairs Problem. FSTTCS 2005: 164-176 - [c4]Refael Hassin, Danny Segev:
The Multi-radius Cover Problem. WADS 2005: 24-35 - [c3]Asaf Levin, Danny Segev:
Partial Multicuts in Trees. WAOA 2005: 320-333 - [c2]Refael Hassin, Danny Segev:
Rounding to an Integral Program. WEA 2005: 44-54 - 2004
- [c1]Refael Hassin, Danny Segev:
Robust Subgraphs for Trees and Paths. SWAT 2004: 51-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
