Campus Event Calendar: Parinya Chalermsook (09/12/2013 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Graph Products and Hardness of Approximation

Parinya Chalermsook

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Thursday, 12 September 2013

13:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

We present a simple framework for proving tight hardness of approximation. In this framework, the question of proving lower bounds is reduced to the (simple) task of proving graph product inequalities. The technique has been used to prove new hardness results for almost 10 problems so far.

(Joint with B. Laekhanukit and D. Nanongkai)

Contact

Parinya Chalermsook

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Parinya Chalermsook, 09/11/2013 21:52
Parinya Chalermsook, 08/23/2013 16:34
Parinya Chalermsook, 08/23/2013 16:33 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis