Library Working Hours During Recess
Monday to Friday	09:00 AM - 07:00 PM
Saturday	09:00 AM - 05:00 PM
Sundays & Holidays	Closed

Patron Checkouts
Patrons	No. of Books Issued	Loan Period	Overdue Charges
Faculty	25	6 months	Nil
Students	10	2 Weeks	Re. 1 Per Book Per Day
Research Scholars	15	30 Days	Nil
Staff	5	30 Days	Nil

Normal view MARC view ISBD view

Complexity and approximation : combinatorial optimization problems and their approximability properties /

Ausiello, G.

Complexity and approximation : combinatorial optimization problems and their approximability properties / G Ausiello and others - New York Springer 1999 - 524 p. With CD-Rom.

ISBN: 9783540654315

Subjects--Topical Terms:
Computer algorithms. ﾠ
Computational complexity. ﾠ
Combinatorial optimization. ﾠ

Dewey Class. No.: 519.3 AUS-G

Print
Add to your cart (remove)
Send to device
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)