Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Online Independent Set with Stochastic Adversaries
Speaker:Martin Hoefer
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 18 February 2014
Duration:30 Minutes
Building:E1 4
The independent set problem in graphs is a classic problem in algorithms. For many practically relevant graph classes, including interval, disk, or rectangle graphs, there exist good approximation algorithms. Much less is known about the natural online variant of the problem - most likely due to simple worst-case lower bounds of \Omega(n) that apply even to interval graphs. In this talk I highlight some of our recent work for online variants with stochastic adversaries, including O(1)-competitive algorithms for interval and disk graphs. These results can be extended to polylogarithmic guarantees for rectangle graphs and for more general online admission problems in wireless networks.
Name(s):Martin Hoefer
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Martin Hoefer, 01/21/2014 08:19 PM
Last modified:
Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Martin Hoefer, 01/21/2014 08:19 PM -- Created document.