European Mathematical Society - h. t. lau
https://euro-math-soc.eu/author/h-t-lau
enA Java Library of Graph Algorithms and Optimization + CD
https://euro-math-soc.eu/review/java-library-graph-algorithms-and-optimization-cd
<div class="field field-name-field-review-review field-type-text-with-summary field-label-hidden"><div class="field-items"><div class="field-item even"><div class="tex2jax"><p>The series â€˜Discrete Mathematics and Its Applicationsâ€™ has delivered an unusual fruit this time: a library of algorithms for various combinatorial problems programmed in Java. The book covers all the usual areas of algorithmic graph theory and optimization ranging from the random generation of graphs, connectivity, network flows and graph embedding, to linear and quadratic optimization, each area being discussed in a separate chapter. The chapters share a common structure and each of them lists a bunch of related problems. All problems are first described and then an outline of the algorithm is presented, followed by a full program. The program is accompanied by a description of inputs and outputs and a simple example of its use. The code of the programs is also available on a CD included in the book. </p>
<p>However, serious users of the book will notice several drawbacks: the description of the algorithms sometimes lacks important details such as the time complexity (which is surprising, especially in exponential algorithms for NP-complete problems) and the program code is often hard to understand because the aspiration to make all programs self-contained has led to avoiding all abstractions and repeating the same code patterns in many places. For some problems, faster and more easily implemented algorithms are already known. In short, it is a good book for anybody who needs to solve an isolated problem but more experienced programmers will probably still prefer the existing open-source program libraries like LEDA or Pigale.</p>
</div></div></div></div><div class="field field-name-field-review-reviewer field-type-text field-label-inline clearfix"><div class="field-label">Reviewer: </div><div class="field-items"><div class="field-item even">mmar</div></div></div><span class="vocabulary field field-name-field-review-author field-type-taxonomy-term-reference field-label-inline clearfix"><h2 class="field-label">Author: </h2><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/author/h-t-lau" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">h. t. lau</a></li></ul></span><span class="vocabulary field field-name-field-review-publisher field-type-taxonomy-term-reference field-label-inline clearfix"><h2 class="field-label">Publisher: </h2><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/publisher/chapman-hallcrc" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">chapman & hall/crc</a></li></ul></span><div class="field field-name-field-review-pub field-type-number-integer field-label-inline clearfix"><div class="field-label">Published: </div><div class="field-items"><div class="field-item even">2006</div></div></div><div class="field field-name-field-review-isbn field-type-text field-label-inline clearfix"><div class="field-label">ISBN: </div><div class="field-items"><div class="field-item even">1-58488-718-4</div></div></div><div class="field field-name-field-review-price field-type-text field-label-inline clearfix"><div class="field-label">Price: </div><div class="field-items"><div class="field-item even">USD 99,95</div></div></div><span class="vocabulary field field-name-field-review-msc field-type-taxonomy-term-reference field-label-hidden"><ul class="vocabulary-list"><li class="vocabulary-links field-item even"><a href="/msc/90-operations-research-mathematical-programming" typeof="skos:Concept" property="rdfs:label skos:prefLabel" datatype="">90 Operations research, mathematical programming</a></li></ul></span>Wed, 01 Jun 2011 16:45:05 +0000Anonymous39325 at https://euro-math-soc.eu