14161 search results - page 183 / 2833 » On generalized middle-level problem |
165
click to vote
IPCO
1993
15 years 6 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
181
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
150
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
168
click to vote
CSFW
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
169
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...