| Document Date: 2015-02-19 14:45:50
Open Document File Size: 925,44 KBShare Result on Facebook
Company Fiat / VF / Creative Commons / Dagstuhl Publishing / / Country Germany / Jordan / / / Facility Brown University / NSF-supported Institute / / IndustryTerm ultimate solution / output solution / constant-factor approximation algorithm / unknown near-optimal solution / algorithmic tool / logarithmic-factor approximation algorithms / approximation algorithm / polynomial time algorithm / telecommunications / near-optimal solution / polynomial-time algorithm / constant-factor approximation algorithms / approximation algorithms / / Movie North and South / Mortar Graph and Bricks / / NaturalFeature Steiner forest / / Organization National Science Foundation / Brown University / Institute for Computational and Experimental Research / / Person Philip N. Klein / Claire Mathieu / Bill Editors / Hang Zhou / / Position Editor / / Product Augmentation Theorem / / ProgrammingLanguage TSP / / Technology logarithmic-factor approximation algorithms / constant-factor approximation algorithm / polynomial-time 2-approximation algorithm / 2.2 Nonnumerical Algorithms / polynomial time algorithm / approximation algorithm / constant-factor approximation algorithms / 2-approximation algorithm / polynomial-time algorithm / 7 Algorithm / approximation algorithms / Digital Object Identifier / /
SocialTag |
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein∗†1 , Claire Mathieu†2 , and Hang Zhou†3 1 Brown University, United States