From b6aa0b124de02bda659db226ef66f1886f98252e Mon Sep 17 00:00:00 2001 From: Stratis Ioannidis Date: Thu, 1 Nov 2012 23:42:57 -0700 Subject: stratis comments --- intro.tex | 1 + 1 file changed, 1 insertion(+) (limited to 'intro.tex') diff --git a/intro.tex b/intro.tex index 7a75f37..ba46534 100644 --- a/intro.tex +++ b/intro.tex @@ -62,3 +62,4 @@ general submodular function in the secretary posted price model randomized $O(\log n)$-competitive algorithm. In the bidding model $O(1)$-competitive algorithm. +\stratis{What is known about the maximization of logdet in the non-strategic case? Is it NP hard? Approximation ratios?} -- cgit v1.2.3-70-g09d2