Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, December 20, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Jörg Priewasser

Exact and approximative algorithms for coloring G(n,p)

This paper investigates the problem of coloring the random graph G(n,p) in polynomial expected time. For the case p <= 1.01/n an algorithm is presented which finds an optimal colouring in linear expected time. For p>=(ln n)^6/n algorithms are derived which approximate the chromatic number within a factor of O(\sqrt{np}). Additionally, in this way algorithms which approximate the independence number are obtained.

Paper by A.Coja-Oghlan and A.Taraz, Exact and approximative algorithms for coloring G(n,p), Random Structures and Algorithms 24 (3) (2004).

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login