Now showing items 1-3 of 3
Algorithmic aspects of connectivity, allocation and design problems
(Georgia Institute of Technology, 2008-05-23)
Most combinatorial optimization problems are NP -hard, which imply that under well- believed complexity assumptions, there exist no polynomial time algorithms to solve them. To cope with the NP-hardness, approximation ...
Algorithms for budgeted auctions and multi-agent covering problems
(Georgia Institute of Technology, 2009-07-07)
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, ...
Allocation problems with partial information
(Georgia Institute of Technology, 2012-06-28)
Allocation problems have been central to the development of the theory of algorithms and also find applications in several realms of computer science and economics. In this thesis we initiate a systematic study of these ...