Competitive algorithms for online matching and vertex cover problems
Year: 2013
Type: dissertation
Abstract: The past decade has witnessed an explosion of research on the online bipartite matching problem.Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before.One of the motivation for studying this problem is that it significantly generalizes the classical ski rental problem.An instance of such problems specifies a bipartite graph G = (L, R, E) whose left vertices L are offline and right vertices arrive online one at a time.An algorithm must maintain a valid vertex cover from which no vertex can ever be removed.The objective is to minimize the size of the cover.In this thesis, we introduce a charging-based algorithmic framework for this problem as well as its generalizations.One immediate outcome is a simple analysis of an optimal 1-1/e competitive algorithm for online bipartite vertex cover.By extending the charging-based analysis in various nontrivial ways, we also obtain optimal l_1 e-competitive algorithms
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2567159348
