Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 12, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Hung Hoang

Hardness of Approximating the Rank of a Graph Divisor

Graph divisor theory is a combinatorial analogue of the divisor theory in algebraic geometry. A fundamental concept in this area is the rank of a graph divisor. It is already known that computing the rank is NP-hard (Kiss and Tóthmérész, 2015). By a reduction from the Minimum Target Set Selection problem, we show that no polynomial-time algorithm can approximate the rank within the factor of 2^{O(log^{1-ε}n)} unless P = NP, and assuming a weaker conjecture (the Planted Dense Subgraph Conjecture), there is no polynomial time O(n^{1/2-ε})-approximation

Joint work with Kristóf Bérczi and Lilla Tóthmérész.

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