![](https://dblp.uni-trier.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
ACM Journal of Experimental Algorithmics, Volume 7
Volume 7, 2002
Selected papers from the Fourth Workshop on Algorithm Engineering (WAE 00), September 2000, Saarbrücken
- Werner Backes, Susanne Wetzel:
Heuristics on Lattice Basis Reduction in Practice. 1 - Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. 2 - Susanne Albers, Bianca Schröder:
An Experimental Study of Online Scheduling Algorithms. 3 - Kurt Mehlhorn, Guido Schäfer:
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. 4 - Stefan Edelkamp, Patrick Stiegeler:
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. 5 - Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. 6 - Isabelle Guérin Lassous, Jens Gustedt
:
Portable List Ranking: An Experimental Study. 7 - Jan Vahrenhold, Klaus H. Hinrichs:
Planar Point Location For Large Data Sets: To Seek Or Not To Seek. 8 - Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter
:
Efficient Sorting Using Registers and Caches. 9
- Francine Herrmann
, Alain Hertz:
Finding the Chromatic Number by Means of Critical Graphs. 10 - Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. 11 - Filippo Neri:
Relational Concept Learning by Cooperative Evolution. 12
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.