543 search results - page 35 / 109 » New Upper Bounds for MaxSat |
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
CPM
2007
Springer
15 years 1 months ago
2007
Springer
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
ISPD
2003
ACM
15 years 3 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
ISW
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we examine general mechanisms that a covert channel may exploit and derive new minimum requirements for setting up a covert channel. We also propose a new classifica...