OpenAlex
PricingAboutJobs
Log inGet started
Work

LP Rounding for k-Centers with Non-uniform Hard Capacities

HTML

Year: 2012
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/focs.2012.63
Authors: Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller
Institutions: Dalle Molle Institute for Artificial Intelligence Research, Università della Svizzera italiana, University of Maryland, College Park
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: k-center problem, LP rounding, approximation algorithms, constant-factor approximation, facility location

Open Access status: closed

Funders: National Science Foundation, Office of Naval Research
OpenAlex ID: W2005694048
FWCI: 3.19
Cites: 38
Cited by: 90
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security