On the differences between "Practical" and "Applied"

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1982 LNCS, Issue , 2001, Pages 1-10

  Weihe, Karsten ^a  

^a Forsch Inst fur Diskrete Math   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958975779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44691-5_1     Document Type: Conference Paper

References (17)

1. B. Gerards: Matching. In M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. and Nemhauser (eds.): Handbook in Operations Research and Management Science 7, (Network Models), Elsevier, 1995.
2. J. Hooker: Needed: An Empirical Science of Algorithms. Operations Research (1994), 201-212.
3. J. Hooker: Testing Heuristics: We Have It All Wrong. Journal of Heuristics (1995), 33-42.
4. M.A. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
5. D.S. Johnson: A Theoretician's Guide to the Experimental Analysis of Algorithms. http://www.research.att.com/~dsj/papers/exper.ps, 1996.
6. H.F. Jackson, P.T. Boggs, S.G. Nash und S. Powell: Guidelines for Reporting Results of Computational Experiments - Report of the Ad Hoc Committee. Mathematical Programming (1991), 413-425.
7. C.Y. Lee, J. Bard, M.L. Pinedo und W. Wilhelm: Guidelines for Reporting Computational Results in IIE Transactions. IEE Transactions (1993), 121-123.
8. C. McGeoch: Analyzing Algorithms by Simulation: Variance Reduction Techniques and Simulation Speedups. ACM Computing Surveys (1992), 195-212.
9. C. McGeoch: Toward an Experimental Method of Algorithm Simulation. INFORMS Journal on Computing (1996), 1-15.
10. B. Moret: Experimental Algorithmics: Old Problems and New Directions. Slides of an invited lecture in: On-Line Proceedings of the 2nd Workshop on Algorithms Engineering (WAE '98), http://www.mpi-sb.mpg.de/~wae98/PROCEEDINGS/.
11. R.H. Möhring, M. Müller-Hannemann and K. Weihe: Mesh Refinement via Bidirected Flows - Modeling, Complexity, and Computational Results. Journal of the ACM 44 (1997), 395-426.
12. M. Müller-Hannemann and K. Weihe: On the Discrete Core of Quadrilateral Mesh Refinement. International Journal on Numerical Methods in Engineering (1999), 593-622.
13. S. Skiena: The Algorithm Design Manual. Springer, 1998.
14. K. Weihe: Covering Trains by Stations or the Power of Data Reduction. On-Line Proceedings of the 1st Workshop on Algorithms and Experiments (ALEX '98), http://rtm.science.unitn.it/alex98/proceedings.html.
15. K. Weihe, U. Brandes, A. Liebers, M. Müller-Hannemann, D. Wagner, and T. Willhalm: Empirical Design of Geometric Algorithms. Proceedings of the 15th ACM Symposium on Computational Geometry (SCG '99), 86-94.
16. K. Weihe and T. Willhalm: Why CAD Data Repair Requires Discrete Techniques. On-Line Proceedings of the 2nd Workshop on Algorithms Engineering (WAE '98), http://www.mpi-sb.mpg.de/~wae98/PROCEEDINGS/.
17. K. Weihe and T. Willhalm: Reconstructing the Topology of a CAD Model - A Discrete Approach. Algorithmica 26 (2000), 126-147.