When i was in high school, we had band camp at Wright State University in Dayton, Ohio. It was pretty fun. The marching and learning the show part wasn’t all that great, but we played a ton of video games and just generally had fun. I remember explorining the buildings, looking at academic papers, and being somewhat turned off by the idea of going to graduate school. I’d see this huge poster with some title like ‘Distilled k-polychlorate subgroups with isometric properties’ or some other incomprehenisble gibberish. Usually there would be some kind of picture or a goofy chart that looked like it might be interesting if you understood what the hell was going on. I tried to read snippets of those posters but it just made no sense so I got bored and wandered off, to do something like choreagraph a wiffle-bat fight with Paul Dehmer.
I’ve spent the past 8 weeks doing research at Harvey Mudd College in Claremont, California. The work we are doing is theoretical computer science, which means we are solving mathematical problems dealing with algorithms. We’ve just about finished our work in the theory domain, and we’ll spend the rest of our time writing up this paper and maybe running some simulations to see how well our plans work in progress. The title of our paper will be something like “Approximation Algorithms for Grooming Problems in WDM Ring Networks.” That sounds kind of gnarly, but I assure you it’s really not all that complicated.
At least, it doesn’t seem that way to me now. I have been working on this stuff for the past 8 weeks, thinking of nothign besides this, reading a bunch of papers and scribbling my thoughts on a yellow notebook, so maybe it is kind of complicated? I don’t know.
The point of this entry was that most of the problems i’m dealing with can be summed up very simply: I give you a bunch of different objects, each of which has a different weight and profit associated with it. Then I tell you, you have ‘W’ boxes, each of which can hold ‘C’ units of weight; find a way to get a decent profit. That’s not so bad, is it? It’s complicated by the fact that certain objects can be split into several boxes, sometimes there are limitations (i.e this object can only go in this box), etc. On top of that, we have to make sure the running time is polynomial in the size of the problem, which means we can never get the best possible solution and therefore have to prove some boundary between our solution and the best one possible; something like ‘our profit is always at least half of the most profit you could possibly make.’
I don’t know. Maybe that sounds complicated to you. It seems pretty simple to me, though. Maybe because it really is simple, or maybe it’s just the fact that i’ve been working on it for so long. In any case, I am no longer under the impression that grad school willl be difficult.
Woot.