| Publication | Date of Publication | Type |
|---|
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem
Operations Research | 2024-03-12 | Paper |
The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications
Operations Research | 2024-03-12 | Paper |
| Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps | 2023-09-04 | Paper |
Approximation algorithms for the generalized incremental knapsack problem
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
Technical note -- Approximation schemes for capacity-constrained assortment optimization under the nested logit model
Operations Research | 2022-12-01 | Paper |
A polynomial-time approximation scheme for sequential batch testing of series systems
Operations Research | 2022-05-31 | Paper |
Mallows-smoothed distribution over rankings approach for modeling choice
Operations Research | 2022-02-16 | Paper |
The approximability of assortment optimization under ranking preferences
Operations Research | 2020-11-08 | Paper |
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Operations Research | 2020-10-12 | Paper |
The approximability of multiple facility location on directed networks with random arc failures
Algorithmica | 2020-09-03 | Paper |
| Online algorithms for maximum cardinality matching with edge arrivals | 2020-05-27 | Paper |
Approximation algorithms for dynamic assortment optimization models
Mathematics of Operations Research | 2020-03-12 | Paper |
A polynomial-time approximation scheme for the airplane refueling problem
Journal of Scheduling | 2019-10-08 | Paper |
The ordered \(k\)-median problem: surrogate models and approximation algorithms
Mathematical Programming. Series A. Series B | 2019-08-06 | Paper |
Online algorithms for maximum cardinality matching with edge arrivals
Algorithmica | 2019-05-07 | Paper |
Maintenance scheduling for modular systems: modeling and algorithms
Naval Research Logistics | 2019-05-02 | Paper |
Approximation algorithms for sequential batch-testing of series systems
Naval Research Logistics | 2019-05-02 | Paper |
Assortment planning with nested preferences: dynamic programming with distributions as states?
Algorithmica | 2019-01-11 | Paper |
Optimal codon randomization via mathematical programming
Journal of Theoretical Biology | 2018-10-04 | Paper |
Improved bounds for randomized preemptive online matching
Information and Computation | 2018-03-21 | Paper |
A sublogarithmic approximation for tollbooth pricing on trees
Mathematics of Operations Research | 2017-06-02 | Paper |
The approximability of partial vertex covers in trees
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Improved bounds for online preemptive matching
(available as arXiv preprint) | 2017-01-30 | Paper |
Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
Operations Research | 2016-05-13 | Paper |
Robust subgraphs for trees and paths
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Approximating \(k\)-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Improved online algorithms for the sorting buffer problem on line metrics
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Set connectivity problems in undirected graphs and the directed Steiner network problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
An approximate dynamic-programming approach to the joint replenishment problem
Mathematics of Operations Research | 2014-07-11 | Paper |
Mobile facility location: combinatorial filtering via weighted occupancy
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science | 2014-01-09 | Paper |
On the approximability of reachability-preserving network orientations
Internet Mathematics | 2012-08-29 | Paper |
Approximation algorithms and hardness results for shortest path based graph orientations
Combinatorial Pattern Matching | 2012-08-14 | Paper |
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Information Processing Letters | 2012-03-27 | Paper |
Improved approximation guarantees for weighted matching in the semi-streaming model
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
| IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * | 2012-01-23 | Paper |
Approximation algorithms for orienting mixed graphs
Combinatorial Pattern Matching | 2011-06-29 | Paper |
A unified approach to approximating partial covering problems
Algorithmica | 2011-03-30 | Paper |
Improved Orientations of Physical Networks
Lecture Notes in Computer Science | 2010-10-05 | Paper |
The complexity of bottleneck labeled graph problems
Algorithmica | 2010-09-16 | Paper |
A sublogarithmic approximation for highway and tollbooth pricing
Automata, Languages and Programming | 2010-09-07 | Paper |
| Set connectivity problems in undirected graphs and the directed Steiner network problem | 2010-08-06 | Paper |
Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Algorithmica | 2010-02-23 | Paper |
Scheduling with Outliers
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Path hitting in acyclic graphs
Algorithmica | 2009-05-13 | Paper |
Bi-criteria linear-time approximations for generalized k-mean/median/center
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Rounding to an integral program
Operations Research Letters | 2008-09-10 | Paper |
The Complexity of Bottleneck Labeled Graph Problems
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Approximation algorithms and hardness results for labeled connectivity problems
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A Unified Approach to Approximating Partial Covering Problems
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Path Hitting in Acyclic Graphs
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Improved Online Algorithms for the Sorting Buffer Problem
STACS 2007 | 2007-09-03 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Partial multicuts in trees
Theoretical Computer Science | 2007-01-09 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Assortment Optimization with Visibility Constraints
(available as arXiv preprint) | N/A | Paper |
