Work

Linear and Convex Programming Based Algorithms for Network Design

Year: 2019
Type: article
Abstract: This thesis presents linear and convex programming based algorithms for NP-hard discrete optimization problems, mainly with applications in network design. Network design problems aim to find a minimal/maximal weighted subgraph satisfying given properties. The problems studied include maximum cut, buy-at-bulk network design, throughput maximization, and unrelated machine scheduling. This thesis considers different models of input uncertainty: the traditional deterministic setting, the online setting where inputs arrive over time and the stochastic setting where inputs are drawn from some probability distribution. Our approach to these problems involves solving suitable convex relaxations and then using rounding procedures to convert the fractional solutions to integer solutions. The specific contributions of this thesis include (1) approximation algorithms for a constrained variant of the maximum cut problem using the Sherali-Adams LP hierarchy; (2) online primal-dual algorithms for covering and packing with Lq norm objectives; (3) approximation algorithms for stochastic unrelated machine scheduling.
Language: English
Open Access status: green
OpenAlex ID: W3155946657
FWCI:
Cites: 122
Cited by:
Related to: 10