Title	Algorithms for Stable and Perturbation-Resilient Problems
Creator	Makarychev, Yury
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-11-13T15:34
Description	We study the notion of stability and perturbation resilience introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A combinatorial optimization problem is α-stable or α-perturbation-resilient if the optimal solution does not change when we perturb all parameters of the problem by a factor of at most α. We present improved algorithms for stable instances of various clustering and optimization problems, including k-means, k-median, Max Cut, and Minimum Multiway Cut. We also show several hardness results. The talk is based on joint papers with Haris Angelidakis, Konstantin Makarychev, and Aravindan Vijayaraghavan.
Extent	31 minutes
Subject	Mathematics; Computer science; Operations research, mathematical programming; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Toyota Technological Institute at Chicago
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-05-13
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0366262
URI	http://hdl.handle.net/2429/65830
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

Algorithms for Stable and Perturbation-Resilient Problems Makarychev, Yury

Description

Item Metadata

Item Media

Item Citations and Data

Rights