Theory and Practice of Algorithms in (Computer) Systems [electronic resource] : First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings / edited by Alberto Marchetti-Spaccamela, Michael Segal.

Contributor(s):

Series: Lecture Notes in Computer Science ; 6595Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: X, 266 p. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642197543

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Printed edition:: No titleDDC classification:

005.1 23

LOC classification:

QA76.9.A43

Online resources:

Click here to access online

In: Springer eBooksSummary: This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and selected from 45 submissions. The papers all feature original research in the design, implementation and evaluation of algorithms with special focus on algorithms for combinatorial optimization problems, and to real-world applications, engineering and experimental analysis of algorithms - thus fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.

Item type:

eBooks

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 1 )

No physical items for this record

This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and selected from 45 submissions. The papers all feature original research in the design, implementation and evaluation of algorithms with special focus on algorithms for combinatorial optimization problems, and to real-world applications, engineering and experimental analysis of algorithms - thus fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.