Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

The Steiner tree problem is one of the most fundamental NP-hard problems: given a
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …

Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

Caching refers to the act of replicating information at a faster (or closer) medium with the
purpose of improving performance. This deceptively simple idea has given rise to some of …

This article comprises the first theoretical and computational study on mixed integer
programming (MIP) models for the connected facility location problem (ConFL). ConFL …

We present a simple randomized algorithmic framework for connected facility location
problems. The basic idea is as follows: We run a black-box approximation algorithm for the …

The k‐means problem is one of the most popular models of cluster analysis. The problem is
NP‐hard, and modern literature offers many competing heuristic approaches. Sometimes …

We develop a new approach for online network design and obtain improved competitive
ratios for several problems. Our approach gives natural deterministic algorithms and simple …

The connected facility location (ConFL) problem arises in a number of applications that
relate to the design of telecommunication networks as well as data distribution and …

Increasing prevalence of large-scale distributed monitoring and computing environments
such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in …