Algorithmic aspects of connectivity, allocation and design problems a thesis presented to the academic faculty by deeparnab chakrabarty in partial ful llment. In this thesis, we study the algorithmic aspects of three classes of combinatorial optimization problems using lp-based techniques as our main tool connectivity problems: we study the steiner tree problem and devise new linear programming relaxations for the problem.
In this thesis, we do an algorithmic study of optimization problems in budgeted auctions, and some well known covering problems in the multi-agent setting we give new results for the design of approximation algorithms, online algorithms and hardness of approximation for these problems along the way we give new insights for many other related problems.
Deeparnab chakrabarty thesis next page argumentative essay against school uniforms the two runners-up wrote essays arguing against affirmative action, but to be a pastor, and writing the paper helped his persuasive powers. 2015 deeparnab chakrabarty, kashyap dixit, madhav jha, and c seshadhri property testing on product distributions: optimal testers for bounded derivative properties in proceedings of the symposium on discrete algorithms (soda), 2015.
We refer to the thesis of andelman[and06] for an exposition very recently, and independent of our work, azar etal [abk + 08] obtained a 2=3-factor for the general mba problem. Deeparnab chakrabarty is an assistant professor in the department of computer science at dartmouth college he received a bachelor of technology from iit bombay, and a phd in the aco (algorithms, combinatorics, and optimization) program at georgia tech his research interests are in algorithms and optimization, in particular, approximation algorithms, fast algorithms, and sublinear algorithms. List of computer science publications by deeparnab chakrabarty.
Anand bhalgat, deeparnab chakrabarty, and sanjeev khanna, optimal lower bounds for universal and differentially private steiner trees and tsps, august 2011.
2013 d chakrabarty and c seshadhri an o(n) monotonicity tester for boolean functions over the hypercube in symposium on theory of computing (stoc), 2013 2013 d chakrabarty and c seshadhri optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. Email: [email protected], [email protected] i am a faculty member of the department of computer science , dartmouth college before that, i spent five lovely years at microsoft research, bangalore.