| dc.contributor.author | Borradaile, Glencora | |
| dc.contributor.author | Demaine, Erik D. | |
| dc.contributor.author | Tazari, Siamak | |
| dc.date.accessioned | 2014-05-16T14:36:54Z | |
| dc.date.available | 2014-05-16T14:36:54Z | |
| dc.date.issued | 2012-06 | |
| dc.date.submitted | 2009-02 | |
| dc.identifier.isbn | 978-3-939897-09-5 | |
| dc.identifier.issn | 0178-4617 | |
| dc.identifier.issn | 1432-0541 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/87025 | |
| dc.description.abstract | We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded-genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(nlogn) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS framework from planar graphs to bounded-genus graphs: any problem that is shown to be approximable by the planar PTAS framework of Borradaile et al. (ACM Trans. Algorithms 5(3), 2009) will also be approximable in bounded-genus graphs by our extension. | en_US |
| dc.description.sponsorship | Deutsche Forschungsgemeinschaft (grant MU1482/3-1) | en_US |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada (Postdoctoral fellowship) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer-Verlag Berlin Heidelberg | en_US |
| dc.relation.isversionof | http://stacs2009.informatik.uni-freiburg.de/proceedings_stacs09.pdf | en_US |
| dc.rights | Creative Commons Attribution-NonCommercial-No Derivative Works | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Borradaile, Glencora, Erik D. Demaine, and Siamak Tazari. “Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.” Algorithmica 68, no. 2 (February 2014): 287–311. doi:10.1007/s00453-012-9662-2. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Demaine, Erik D. | en_US |
| dc.relation.journal | Algorithmica | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Borradaile, Glencora; Demaine, Erik D.; Tazari, Siamak | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| mit.license | PUBLISHER_CC | en_US |
| mit.metadata.status | Complete | |
