Approximation Schemes for Planar Graphs: A Survey of Methods

Klein, Philip

Title:

Approximation Schemes for Planar Graphs: A Survey of Methods

dc.contributor.author	Klein, Philip
dc.contributor.corporatename	Georgia Institute of Technology. Algorithms, Randomness and Complexity Center	en_US
dc.contributor.corporatename	Brown University. Dept. of Computer Science	en_US
dc.date.accessioned	2017-04-10T17:23:30Z
dc.date.available	2017-04-10T17:23:30Z
dc.date.issued	2017-03-27
dc.description	Presented on March 27, 2017 at 11:00 a.m. in the Klaus Advanced Computing Building, room 1116E.	en_US
dc.description	Phil Klein is Professor of Computer Science at Brown University. His research area is algorithms for finding optimal and approximately optimal solutions to optimization problems in graphs and networks.	en_US
dc.description	Runtime: 56:45 minutes	en_US
dc.description.abstract	In addressing an NP-hard problem in combinatorial optimization, one way to cope is to use an approximation scheme, an algorithm that, for any given ϵ>0, produces a solution whose value is within a 1+ϵ factor of optimal. For many problems on graphs, obtaining such accurate approximations is NP-hard if the input is allowed to be any graph but is tractable if the input graph is required to be planar. Research on polynomial-time approximation schemes for optimization problems in planar graphs goes back to the pioneering work of Lipton and Tarjan (1977) and Baker (1983). Since then, however, the scope of problems amenable to approximation has broadened considerably. In this talk I will outline some of the approaches used, especially those that have led to recent results.	en_US
dc.format.extent	56:45 minutes
dc.identifier.uri	http://hdl.handle.net/1853/56627
dc.language.iso	en_US	en_US
dc.relation.ispartofseries	Algorithms and Randomness Center (ARC) Colloquium
dc.subject	Approximation algorithms	en_US
dc.subject	Planar graphs	en_US
dc.title	Approximation Schemes for Planar Graphs: A Survey of Methods	en_US
dc.type	Moving Image
dc.type.genre	Lecture
dspace.entity.type	Publication
local.contributor.corporatename	Algorithms and Randomness Center
local.contributor.corporatename	College of Computing
local.relation.ispartofseries	ARC Colloquium
relation.isOrgUnitOfPublication	b53238c2-abff-4a83-89ff-3e7b4e7cba3d
relation.isOrgUnitOfPublication	c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication	c933e0bc-0cb1-4791-abb4-ed23c5b3be7e