Approximating Solution Structure

Dagstuhl Seminar Proceedings

Volumn 7281, Issue , 2007, Pages

  Hamilton, Matthew ^a   Müller, Moritz ^b   Van Rooij, Iris ^c   Wareham, Todd ^d  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF FREIBURG   (Germany)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^d MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Approximation Algorithms; Computational Complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMAL SYSTEMS;

APPROXIMABILITY; COGNITIVE SCIENCE; OPTIMAL SOLUTIONS; OPTIMAL VALUES; SOLUTION STRUCTURES; VALUE APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 49949094172     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
2. Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2004)
3. Frixione, M.: Tractable competence. Minds and Machines 11 (2001) 379-397 4. van Rooij, I.: Tractable Cognition: Complexity Theory in Cognitive Psychology. Ph.D. thesis, Department of Psychology, University of Victoria (2003)
4. Chater, N., Tenebaum, J.B., Yuille, A.: Special issue: Probabilistic models in cognition. Trends in Cognitive Science 10 (2006)
5. Pothos, E.M., Chater, N.: A simplicity principle in unsupervised human categorization. Cognitive Science 26 (2002) 303-343
6. Tenenbaum, J., Griffiths, T., Niyogi, S.: Intuitive theories as grammars for causal inference. In Gopnik, A., Schulz, L., eds.: Causal learning: Psychology, philosophy, and computation, Oxford University Press (2007)
7. Millgram, E.: Coherence: The price of the ticket. Journal of Philosophy 97 (2000) 82-93
8. Thagard, P., Verbeurght, K.: Coherence as Constraint Satisfaction. Cognitive Science 22 (1998) 1-24
9. Goldreich, O.: Combinatorial Property Testing - a survey. In Pardalso, P., Rajasekaran, S., Rolim, J., eds.: Randomization Methods in Algorithm Design, AMSDIMACS (1988) 45-60
10. Marko, S., Ron, D.: Distance Approximation in Bounded-Degree and General Sparse Graphs. In Diaz, J., Jansen, K., Rolim, J., Zwicik, U., eds.: Approximation, Randomization, and Combinatorial Optimization - Algorithms and Techniques: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006) and the 10th International Workshop on Randomization and Computation (RANDOM 2006). Volume 4110 of Lecture Notes in Computer Science., Springer-Verlag, Berlin (2006) 475-486
11. Marx, D.: Parameterized complexity and approximation algorithms. Computer Journal (2007)
12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
13. Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press (1997)
14. Hastad, J.: Clique is hard to approximate within n 1-σ. Acta Mathematica 182 (1999) 105-142
15. Chen, Z.Z., Toda, S.: On the Complexity of Computing Optimal Solutions. International Journal of Foundations of Computer Science 2 (1991) 207-220
16. Papadimitriou, C., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences 43 (1991) 425-440
17. Bodlaender, H., Downey, R., Fellows, M., Wareham, T.: The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147 (1994) 31-54
18. Bodlaender, H., Downey, R., Fellows, M., Hallett, M., Wareham, T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11 (1995) 49-57
19. Hamilton, M., Müller, M., van Rooij, I., Wareham, T.: Approximating Solution Structure. Technical Report 2007-02, Department of Computer Science, Memorial University of Newfoundland (2007)