Back to Results
First PageMeta Content
NP-complete problems / Graph operations / Dominating set / Neighbourhood / Tree decomposition / Tree / Planar graph / Graph / Degree / Graph theory / Mathematics / Theoretical computer science


Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract
Add to Reading List

Document Date: 2013-10-10 10:36:31

Open Document

File Size: 378,89 KB

Share Result on Facebook

City

Berlin / New York / /

Company

Walmart / dG / Kmart / Washington Post / Starbucks / /

Country

United States / /

Currency

pence / /

Facility

Brown University / /

IndustryTerm

Fixed-parameter algorithms / approximation algorithm / polynomialtime approximation algorithm / near-optimal solution / dynamic-programming algorithm / approximate solution / breadth-first-search depth firehouses / polynomial-time algorithm / travel time / penala polynomial-time algorithm / computing / breadth-first search depth / Approximation algorithms / /

Organization

National Science Foundation / Brown University / ded / /

Person

M. Grigni / David Eppstein / Philip N. Klein / Samir Khuller / Moses Charikar / David Eisenstat∗ Philip / Claire Mathieu / Hans L. Bodlaender / Karl Heinrich Hofmann / Dimitrios M. Thilikos / A. Woloszyn / D. R. Karger / Martin Aigner / M. Ziegler / Sanjeev Arora / Prabhakar Raghavan / Mohammad Taghi Hajiaghayi / Fedor V. Fomin / Satish Rao / Feder Greene / Daniel Greene / Erik D. Demaine / /

ProgrammingLanguage

C / TSP / /

ProvinceOrState

New York / /

PublishedMedium

Journal of the ACM / Washington Post / /

Technology

dynamic-programming algorithm / Fixed-parameter algorithms / following algorithm / trade-off table Ujσ using Algorithm / 3δ Algorithm / call Algorithm / polynomialtime approximation algorithm / polynomialtime 2-approximation algorithm / approximation algorithm / polynomial-time algorithm / Approximation algorithms / The algorithm / penala polynomial-time algorithm / /

URL

http /

SocialTag