Normal view MARC view ISBD view

Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications /

Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications / [electronic resource] : edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon. - Berlin Heidelberg : Springer-Verlag GmbH., 2006 - vi, 347 p. : ill., digital ; 24 cm. - Lecture Notes in Computer Science, 3484 0302-9743 ; .

ISBN: 9783540322139 (electronic bk.)

Subjects--Topical Terms:
Combinatorial optimization.
Online algorithms.
Computer Science.
Algorithm Analysis and Problem Complexity.
Algorithms.
Computer Communication Networks.
Computer Graphics.
Discrete Mathematics in Computer Science.
Numeric Computing.

LC Class. No.: QA164 / .E24 2006

Dewey Class. No.: 005.1

Print
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)

Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications /

Contact Us

Copyright ©The National University of Malaysia Library