Title	Online Covering with Sum of Lq-norm Objectives
Creator	Nagarajan, Viswanath
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-11-16T10:31
Description	We consider fractional covering problems with Lq-norm objectives, where the covering requirements arrive online. This can be viewed as a convex programming problem, and we provide a log-competitive algorithm based on a primal-dual approach. This result expands the class of convex programs with good online algorithms. As applications, we obtain online algorithms for non-uniform buy-at-bulk network design and throughput maximization under Lq-norm capacities.
Extent	30 minutes
Subject	Mathematics; Computer science; Operations research, mathematical programming; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Michigan
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-05-16
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0366861
URI	http://hdl.handle.net/2429/65913
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos