Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover

Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to opti mal solutions in near-linear time. The current study is a preliminary step in investigating human performance on another hard problem, the Minimum Vertex Cover Problem, in which solvers attempt to find a smallest set of vertices that ensures that every edge in an undirected graph is incident with at least one of the selected vertices. We identify appropriate measures of performance, examine features of problem instances that impact performance, and describe strategies typically employed by participants to solve instances of the Vertex Cover problem.

[1]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[2]  Michael D. Lee,et al.  Neural Network and Tree Search Algorithms for the Generation of Path-Following (Trail-Making) Tests , 1997 .

[3]  Susanne Tak,et al.  Some Tours are More Equal than Others: The Convex-Hull Model Revisited with Lessons for Testing Models of the Traveling Salesperson Problem , 2008, J. Probl. Solving.

[4]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[5]  Ulrike Stege,et al.  Resolving conflicts in problems from computational biology , 1999 .

[6]  Christian D. Schunn,et al.  Global vs. local information processing in visual/spatial problem solving: The case of traveling salesman problem , 2007, Cognitive Systems Research.

[7]  Richard Bellman,et al.  On the Concepts of a Problem and Problem-Solving , 1960 .

[8]  Zygmunt Pizlo,et al.  Non-Euclidean Traveling Salesman Problem , 2008 .

[9]  Sanjeev Arora,et al.  Nearly linear time approximation schemes for Euclidean TSP and other geometric problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[11]  Tamar Kugler.  Decision modeling and behavior in complex and uncertain environments , 2008 .

[12]  Thomas C. Ormerod,et al.  A Comparison of Heuristic and Human Performance on Open Versions of the Traveling Salesperson Problem , 2006, J. Probl. Solving.

[13]  J. Cole Smith,et al.  Finite Optimal Stopping Problems: The Seller’s Perspective , 2011, J. Probl. Solving.

[14]  M E Masson,et al.  Further explorations with a process model for water jug problems , 1980, Memory & cognition.

[15]  Michael D. Lee,et al.  A Hierarchical Bayesian Model of Human Decision-Making on an Optimal Stopping Problem , 2006, Cogn. Sci..

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[17]  Michael D. Lee,et al.  Psychological models of human and optimal performance in bandit problems , 2011, Cognitive Systems Research.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  P M Todd,et al.  Précis of Simple heuristics that make us smart , 2000, Behavioral and Brain Sciences.

[20]  A. Joshi,et al.  The traveling salesman problem: A hierarchical model , 2000, Memory & cognition.

[21]  Douglas Vickers,et al.  Human Performance on Visually Presented Traveling Salesperson Problems with Varying Numbers of Nodes , 2006, J. Probl. Solving.

[22]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[23]  James N MacGregor,et al.  It looks easy! Heuristics for combinatorial optimization problems , 2006, Quarterly journal of experimental psychology.

[24]  T. Ormerod,et al.  Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem , 2004, Memory & cognition.

[25]  Z. Pizlo,et al.  Solving combinatorial problems: The 15-puzzle , 2005, Memory & cognition.

[26]  Gerd Gigerenzer,et al.  Heuristic decision making. , 2011, Annual review of psychology.

[27]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .