We contribute to a body of research asserting that the fractional and integral optima of column-sparse integer programs are "nearby".
Let S be a set of noncrossing triangular obstacles in R sup 3 with convex hull H. A triangulation T of H is compatible with S if every triangle of S is the union of a subset of the faces of T.
The advertisement placement problem deals with space and tune sharing by advertisements on the Internet. Consider.
The domatic number problem is that of partitioning the vertices of an undirected graph into the maximum number of disjoint dominating sets.
We consider the following fundamental scheduling problem. The input to the problem consists of n jobs and k machines.
We consider the following fundamental scheduling problem. The input to the problem consists of n jobs and k machines.
In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world.
We consider the problem of designing a minimum cost access network to carry traffic from a set of endnodes to a core network. Trunks are available in K types reflecting economies of scale.
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests
We study traffic grooming in optical network design. The goal is to aggregate low-bandwidth traffic streams to efficiently utilize high-bandwidth media such as wavelength channels.
