On low dimensional coresetsSariel Har-PeledUniversity of Illinois, Urbana-Champaign (UIUC).In this talk we will review some low-dimension geometric approximationalgorithms that work by extracting a small subset oftheinput, and performing the computation on this small subset.Such subsets, referred to as coresets, had emerged as a powerful tool,and…

Title: Improved Algorithms for Discounted Payoff GamesAbstract:This talk is devoted to the design and analysis of combinatorialalgorithms for solving one-player versions of several prominentinfinite duration games pertinent to automated verification ofcomputerized systems.We present the first two strongly polynomial algorithms for…