TITLE: On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem
SPEAKER: Abie Flaxman
WHEN: Thursday, April 21, 4:30-5:30 PM
WHERE: WEH 6423 (Wean Hall)
ABSTRACT:
Read the rest of this entry »
Registration is now open for the 4th Computational Molecular
Biology Symposium at Carnegie Mellon University, scheduled for
the afternoon of Tuesday April 26, 2005 from 12:00pm-6:00pm in
Newell-Simon Hall 3305.
Registration is free but necessary for our planning. If you
plan to attend, please sign up at…
First, I thank Anupam for telling me about this.
By subscribing to the arXiv mailing list on the subjects that you are interested in, you will get to know what has been submitted to arXiv recently.
Go to http://arxiv.org/archive/cs/cssub.html for more information on how to subscribe and what areas are available.
For example, this is my subscription email.
To: cs@arXiv.org Subject: subscribe Maverick Woo add Data Structures and Algorithms add Discrete Mathematics add Computational Complexity
And this is what I got yesterday:
Read the rest of this entry »
You probably know you can launch the Task Manager by right-clicking on the Task Bar and then click on the Task Manager on the context menu. But do you know it can also be done by pressing Ctrl-Shift-Esc, directly from within any Windows application?
Along the same line, Ctrl-Esc will bring up the Start Menu. Followed by R, you can get to the Run dialog box in three keystrokes. (On a keyboard with a Windows key, it’s possible with just two keystrokes. But that’s a later story.)
