new branch to avoid merge conflict
adding almost complete bruteforce algorithm. In the middle of debugging. and sample test data from spec.
Made more changes to bruteforce.cpp.  Still debugging.
editing input.cpp and input.h to read input through cin
adding greedy1.cpp which does well against antennas with differing coverage sizes, and correspondig changes to data structures in input.cpp
adding greedy2. does better on example in spec than greedy1, but seg faults on some of the .dat files.
Added header for greedy2. Extracted main into a driver file to call various solvers.
Added timing library and basic timing diagnostics.
Added calling layer for solving algorithms and a basic test harness for comparing them.
changes to code structure and fixed greedy2.
fixing formatting error
adding submit directory and submission materials'
adding short documentation for greedy1 and greedy2
Wrote a new, inefficient bruteforce algorithm. It can handle about 20-30 antennas in a reasonable amount of time.
Merge branch 'laura' of https://github.com/ramstlau/eecs477_project into laura
Added a bottomup algo. Mostly works, but needs more work. Still need to
implement a doubly covered list. Still, a few quick tests seem to
indicate that bottomup is fast and effective on inputs with a lower
number of base_stations and quite slow on larger sets. This may change
after things have been debugged.
Created a README with a list of our algorithm ideas.  Would be good for final submission so they can read our thoughts.
Added bottomup explanation to README.
Fixed bottomup. Seems to be working properly. Deals with smaller datasets very well.
Fixed bruteforce2. It's still very inefficient (computes from ground-up for each perm). Works for 20-30 antennas.