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 …

We initiate the study of computing (near-) optimal contracts in succinctly representable
principal-agent settings. Here optimality means maximizing the principal's expected payoff …

The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

Given a directed graph G=(V,E) and an integer k≧1, a k-transitive-closure-spanner (k-TC-
spanner) of G is a directed graph H=(V,E_H) that has (1) the same transitive-closure as G …

We formulate a new hardness assumption, the Strongish Planted Clique Hypothesis
(SPCH), which postulates that any algorithm for planted clique must run in time $ n^{\Omega …

A Compendium on Steiner Tree Problems Page 1 A Compendium on Steiner Tree Problems
Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Hausdorff …

A classic 1993 paper by Althöfer et al. proved a tight reduction from spanners, emulators,
and distance oracles to the extremal function γ of high-girth graphs. This paper initiated a …

We consider temporal graphs with discrete time labels and investigate the size and the
approximability of minimum temporally connected spanning subgraphs. We present a family …

We give approximation algorithms for the Survivable Network problem. The input consists of
a graph G=(V, E) with edge/node-costs, a node subset S⊆ V, and connectivity requirements …

For the well-known Survivable Network Design Problem (SNDP) we are given an undirected
graph G with edge costs, a set R of terminal vertices, and an integer demand ds, t for every …