ESA2003 1 On approximating a geometric prize-collecting traveling salesman problem with time windows Reuven Bar-Yehuda – Technion IIT Guy Even – Tel Aviv.
2. Valid Inequalities for the 0-1 Knapsack Polytope Integer Programming 2011 1.
§1.4 Algorithms and complexity For a given (optimization) problem, Questions: 1)how hard is the problem. 2)does there exist an efficient solution algorithm?
Auction Algorithms for Market Equilibrium Rahul Garg IBM India Research Sanjiv Kapoor Illionis Institute of Technology.
1 Querying Big Data: Theory and Practice Theory –Tractability revisited for querying big data –Parallel scalability –Bounded evaluability Techniques –Parallel.
On the Hardness of Graph Isomorphism Jacobo Tor á n SIAM J. Comput. Vol 33, p1093-1108, 2004. Presenter: Qingwu Yang April, 2006.
A Brief Introduction to Quantum Computation 1 Melanie Mitchell Portland State University 1 This talk is based on the following paper: E. Rieffel & W. Polak,
Computational Complexity, Physical Mapping III + Perl CIS 667 March 4, 2004.
1 On Approximately Fair Allocations of Indivisible Goods Elchanan Mossel Amin Saberi Richard Lipton Vangelis Markakis Georgia Tech AUEB U. C. Berkeley.
Querying Big Data Tractability revisited for querying big data BD-tractability
How Intractable is the ‘‘Invisible Hand’’: Polynomial Time Algorithms for Market Equilibria
Milena Mihail Georgia Tech. with Stephen Young, Giorgos Amanatidis, Bradley Green
