From the reviews of the German edition:"Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance ...
Köp den här e-boken och få 1 till GRATIS!
Språk Engelska ● Formatera PDF ● ISBN 9783662038222 ● Översättare T. Schade ● Utgivare Springer Berlin Heidelberg ● Publicerad 2013 ● Nedladdningsbara 3 gånger ● Valuta EUR ● ID 6341592 ● Kopieringsskydd Adobe DRM
Kräver en DRM-kapabel e-läsare