Sign inSign in

Amartya Shankha Biswas

Professor · MIT

Amartya Shankha Biswas is a professor at MIT working on graph algorithms, graph theory and data compression.

More

Amartya Shankha Biswas is a professor at MIT working on graph algorithms, graph theory and data compression. Biswas's recitations for MIT 6.046J, an upper-level undergraduate course, prove greedy exchange arguments for scheduling and derive the 3/23/2 Christofides bound for the metric traveling salesman problem.

About

Amartya Shankha Biswas is a professor at MIT working on graph algorithms, graph theory and data compression. Biswas's recitations for MIT 6.046J, an upper-level undergraduate course, prove greedy exchange arguments for scheduling and derive the 3/23/2 Christofides bound for the metric traveling salesman problem.

Connections

5

Their places, courses, books and lectures.