OpenAlex
PricingAboutJobs
Log inGet started
Work

Practical Approximation Algorithms for Separable Packing Linear Programs

HTML

Year: 2001
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8–10, 2001 Proceedings
DOI: 10.1007/3-540-44634-6_30
Authors: Feodor F. Dragan, Andrew B. Kahng, Ion I. Măndoiu, Sudhakar Muddu, Alexander Zelikovsky
Institutions: Kent State University, University of California San Diego, University of California, Los Angeles, Georgia State University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: fully polynomial time approximation scheme, multicommodity flow, global routing, VLSI routing, parity constraints
SDG: Industry, innovation and infrastructure

Open Access status: closed
OpenAlex ID: W1869283588
FWCI: 0.417
Cites: 19
Cited by: 2
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