Abstract
The terms “practical” and “applied” are often used synonymously in our community. For the purpose of this talk I will assign more precise, distinct meanings to both terms (which are not intended to be ultimate definitions). More specifically, I will reserve the word “applied” for work whose crucial, central goal is finding a feasible, reasonable (e.g. economical) solution to a concrete real-world problem, which is requested by someone outside theoretical computer science for his or her own work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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, 1
J. Hooker: Needed: An Empirical Science of Algorithms. Operations Research (1994), 201–212.
J. Hooker: Testing Heuristics: We Have It All Wrong. Journal of Heuristics (1995), 33–42.
M.A. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
D.S. Johnson: A Theoretician’s Guide to the Experimental Analysis of Algorithms. http://www.research.att.com/~dsj/papers/exper.ps, 1996.
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.
C.Y. Lee, J. Bard, M.L. Pinedo und W. Wilhelm: Guidelines for Reporting Computational Results in IIE Transactions. IEE Transactions (1993), 121–123.
C. McGeoch: Analyzing Algorithms by Simulation: Variance Reduction Techniques and Simulation Speedups. ACM Computing Surveys (1992), 195–212.
C. McGeoch: Toward an Experimental Method of Algorithm Simulation. INFORMS Journal on Computing (1996), 1–15.
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/.
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.
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.
S. Skiena: The Algorithm Design Manual. Springer, 1998.
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.
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.
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/.
K. Weihe and T. Willhalm: Reconstructing the Topology of a CAD Model-A Discrete Approach. Algorithmica 26 (2000), 126–147.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihe, K. (2001). On the Differences between “Practical” and “Applied”. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-44691-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42512-0
Online ISBN: 978-3-540-44691-0
eBook Packages: Springer Book Archive