3 citations · 5 across the 9 of their papers we have counts for
15 papers
Estimation, Prediction, and Assortment Optimization for Markov Chain Choice Models with Panel Data
Yalcin Akcay, Gerardo Berbeglia, Young-San Lin
We propose a framework for the Markov chain (MC) choice model with panel data, including parameter estimation, personalized choice prediction, and personalized assortment optimizat…
Matching with Committee Preferences
Haoyu Song, Thanh Nguyen, Young-san Lin
We study a many-to-one matching model inspired by school choice, where schools evaluate applicants using multiple rankings rather than a single priority order. We model each school…
Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
Alexander Turoczy, Young-San Lin
We study the online multi-level aggregation problem with deadlines (MLAP-D) introduced by Bienkowski et al. (ESA 2016, OR 2020). In this problem, requests arrive over time at the v…
A few good choices
Thanh Nguyen, Haoyu Song, Young-San Lin
A Condorcet winning set addresses the Condorcet paradox by selecting a few candidates--rather than a single winner--such that no unselected alternative is preferred to all of them…
Routing-Controlled Spanners
Elena Grigorescu, Nithish Kumar Kumar, Young-San Lin
Designing sparse directed spanners, which are subgraphs that approximately maintain distance constraints, has attracted sustained interest in TCS, especially due to their wide appl…
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms have been extensively studied across the computer science community in the recent years, driven by advances in machine learning predictors, which can…
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms has been extensively studied recently in the computer-science community, due to the potential of using machine learning predictions in order to improv…
Directed Buy-at-Bulk Spanners
Elena Grigorescu, Nithish Kumar, Young-San Lin
We present a framework that unifies directed buy-at-bulk network design and directed spanner problems, namely, buy-at-bulk spanners. The goal is to find a minimum-cost routing solu…
Approximation Algorithms for Directed Weighted Spanners
Elena Grigorescu, Nithish Kumar, Young-San Lin
In the pairwise weighted spanner problem, the input consists of an -vertex-directed graph, where each edge is assigned a cost and a length. Given vertex pairs and a distance…
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
Elena Grigorescu, Young-San Lin, Sandeep Silwal +2
Semidefinite programming (SDP) is a unifying framework that generalizes both linear programming and quadratically-constrained quadratic programming, while also yielding efficient s…
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate +3
A heapable sequence is a sequence of numbers that can be arranged in a "min-heap data structure". Finding a longest heapable subsequence of a given sequence was proposed by Byers,…
Online Directed Spanners and Steiner Forests
Elena Grigorescu, Young-San Lin, Kent Quanrud
We present online algorithms for directed spanners and Steiner forests. These problems fall under the unifying framework of online covering linear programming formulations, develop…
Market Equilibrium in Multi-tier Supply Chain Networks
Tao Jiang, Young-San Lin, Thanh Nguyen
We consider a sequential decision model over multi-tier supply chain networks and show that in particular, for series parallel networks, there is a unique equilibrium. We provide a…
The Maximum Binary Tree Problem
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate +3
We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree…
On Variants of Network Flow Stability
Young-San Lin, Thanh Nguyen
We consider a general stable flow problem in a directed and capacitated network, where each vertex has a strict preference list over the incoming and outgoing edges. A flow is stab…