OpenAlex
PricingAboutJobs
Log inGet started
Work

Randomized Rounding without Solving the Linear Program

HTML

Type: article
Author: Neal E. Young
Institution: AT&T (United States)
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: randomized rounding, linear programming relaxation, packing problems, covering problems, approximation algorithms, parallel algorithms, matrix games, probabilistic methods

Open Access status: closed
OpenAlex ID: W2002272911
Cites: 16
Cited by: 183
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