Online Covering: Efficient and Learning-augmented Algorithms
Abstract
We start by slightly modifying the generic framework for solving online covering and packing linear programs (LP) proposed in the seminal work of Buchbinder and Naor (Mathematics of Operations Research, 34, 2009) to obtain efficient implementations in settings in which one has access to a separation oracle.We then apply the generic framework to several online network connectivity problems with LP formulations, namely pairwise spanners and directed Steiner forests. Our results are comparable to the previous state-of-the-art results for these problems in the offline setting.Further, we extend the generic frameworks to online optimization problems enhanced with machine-learning predictions. In particular, we present learning-augmentedalgorithms for online covering LPs and semidefinite programs (SDP), which outperform any optimal online algorithms when the prediction is accurate while maintaining reasonable guarantees when the prediction is misleading. Specifically, we obtain general online learning-augmented algorithms for covering LPs with fractional advice and general constraints and initiate the study of learning-augmented algorithms for covering SDPs.
Degree
Ph.D.
Advisors
Grigorescu, Purdue University.
Subject Area
Artificial intelligence|Educational technology|Information science|Labor relations|Management
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.