One of the most important and well-studied settings for network design i...
While much of network design focuses mostly on cost (number or weight of...
One of the most important and well-studied settings for network design i...
We show that Set Cover on instances with N elements cannot be approximat...
We study two problems that seek a subtree T of a graph G=(V,E) such that...
This paper concerns proving almost tight (super-polynomial) running time...
We introduce the problem of finding a spanning tree along with a partiti...
We consider questions that arise from the intersection between the areas...