User:Jmiller

From REU@MU
Revision as of 21:30, 10 June 2016 by Jmiller (Talk | contribs)

Jump to: navigation, search

Joel Miller studies Computer Science at Oberlin College in Ohio, and is part of the 2016 REU program Marquette. He is working on the Sudoku Distances project with Julia Beilke, advised by Dr. Kim Factor. In his free time, he enjoys rock climbing and making music.


Progress Log

Week 1 (5/31 - 6/3)

  • Attended various orientation events to become familiarized with Marquette campus, libraries, etc.
  • Began research on the Travelling Salesman Problem, and its application to Sudoku Distances
  • Began research on various distance metrics and their applications to Sudoku Distances

Week 2 (6/6 - 6/10)

  • Learned the Christofides Algorithm, a 3/2-approximation algorithm for the TSP.
  • Attended a lecture on proper the components of good research talks and papers by Dr. Brylow.
  • Defined terms for and made simple deductions about the nature of points in the Sudoku Distances project, including proving a stronger version of the triangle equality for some subsets of points in spaces which obey the taxicab metric.
  • Found a heuristic for finding the shortest path with 3 points, and an arbitrary starting point, under some circumstances in the Sudoku Distances project. Proved the correctness of the heuristic.