Results 1  10
of
311
Identifying the minimal transversals of a hypergraph and related problems
 SIAM Journal on Computing
, 1995
"... The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertic ..."
Abstract

Cited by 155 (8 self)
 Add to MetaCart
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be coNPcomplete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs, is shown to be computationally equivalent to transversal hypergraph recognition, i.e., given two hypergraphs H 1; H 2, decide if the sets in H 2 are all the minimal transversals of H 1. The complexity of the search problem related to the recognition of the transversal hypergraph, the computation of the transversal hypergraph, is an open problem. This task needs time exponential in the input size, but it is unknown whether an outputpolynomial algorithm exists for this problem. For several important subcases, for instance if an upper or lower bound is imposed on the edge size or for acyclic hypergraphs, we present outputpolynomial algorithms. Computing or recognizing the minimal transversals of a hypergraph is a frequent problem in practice, which is pointed out by identifying important applications in database theory, Boolean switching theory, logic, and AI, particularly in modelbased diagnosis.
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, Surveys
, 2005
"... ..."
(Show Context)
The Load, Capacity and Availability of Quorum Systems
, 1998
"... A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication and dissemination of information Given a strategy to pick quorums, the load L(S) is th ..."
Abstract

Cited by 96 (11 self)
 Add to MetaCart
(Show Context)
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication and dissemination of information Given a strategy to pick quorums, the load L(S) is the minimal access probability of the busiest element, minimizing over the strategies. The capacity Cap(S) is the highest quorum accesses rate that S can handle, so Cap(S) = 1=L(S).
A constructive proof of the general Lovász Local Lemma
, 2009
"... The Lovász Local Lemma [EL75] is a powerful tool to nonconstructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Si ..."
Abstract

Cited by 83 (1 self)
 Add to MetaCart
The Lovász Local Lemma [EL75] is a powerful tool to nonconstructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive variant can be given under certain more restrictive conditions. Simplifications of his procedure and relaxations of its restrictions were subsequently exhibited in several publications [Alo91, MR98, CS00, Mos06, Sri08, Mos08a]. In [Mos08b], a constructive proof was presented that works under negligible restrictions, formulated in terms of the Bounded Occurrence Satisfiability problem. In the present paper, we reformulate and improve upon these findings so as to directly apply to almost all known applications of the general Local Lemma.
Branching Rules for Satisfiability
 Journal of Automated Reasoning
, 1995
"... Recent experience suggests that branching algorithms are among the most attractive for solving propositional satisfiability problems. A key factor in their success is the rule they use to decide on which variable to branch next. We attempt to explain and improve the performance of branching rules wi ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
(Show Context)
Recent experience suggests that branching algorithms are among the most attractive for solving propositional satisfiability problems. A key factor in their success is the rule they use to decide on which variable to branch next. We attempt to explain and improve the performance of branching rules with an empirical modelbuilding approach. One model is based on the rationale given for the JeroslowWang rule, variations of which have performed well in recent work. The model is refuted by carefully designed computational experiments. A second model explains the success of the JeroslowWang rule, makes other predictions confirmed by experiment, and leads to the design of branching rules that are clearly superior to JeroslowWang. Recent computational studies [2, 7, 13, 21] suggest that branching algorithms are among the most attractive for solving the propositional satisfiability problem. An important factor in their successperhaps the dominant factoris the branching rule they use [...
Lower bounds for random 3SAT via differential equations
 THEORETICAL COMPUTER SCIENCE
, 2001
"... ..."
A parallel algorithmic version of the local lemma
, 1991
"... The Lovász Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck has recently found a method for ..."
Abstract

Cited by 74 (10 self)
 Add to MetaCart
(Show Context)
The Lovász Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results without supplying any efficient way of solving the corresponding algorithmic problems. J. Beck has recently found a method for converting some of these existence proofs into efficient algorithmic procedures, at the cost of loosing a little in the estimates. His method does not seem to be parallelizable. Here we modify his technique and achieve an algorithmic version that can be parallelized, thus obtaining deterministic NC 1 algorithms for several interesting algorithmic problems.
A Survey of Tractable Constraint Satisfaction Problems
, 1997
"... In this report we discuss constraint satisfaction problems. These are problems in which values must be assigned to a collection of variables, subject to specified constraints. We focus specifically on problems in which the domain of possible values for each variable is finite. The report surveys the ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
(Show Context)
In this report we discuss constraint satisfaction problems. These are problems in which values must be assigned to a collection of variables, subject to specified constraints. We focus specifically on problems in which the domain of possible values for each variable is finite. The report surveys the various conditions that have been shown to be sufficient to ensure tractability in these problems. These are broken down into three categories: ffl Conditions on the overall structure; ffl Conditions on the nature of the constraints; ffl Conditions on bounded pieces of the problem. 1 Introduction A constraint satisfaction problem is a way of expressing simultaneous requirements for values of variables. The study of constraint satisfaction problems was initiated by Montanari in 1974 [34], when he used them as a way of describing certain combinatorial problems arising in imageprocessing. It was quickly realised that the same general framework was applicable to a much wider class of probl...
Lifts, Discrepancy and Nearly Optimal Spectral Gaps
"... Let G be a graph on n vertices. A 2lift of G is a graph H on 2n vertices, with a covering map : H ! G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n \new" eigenvalues. We conjecture that every dregular graph has a 2lift such that all new ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
(Show Context)
Let G be a graph on n vertices. A 2lift of G is a graph H on 2n vertices, with a covering map : H ! G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n \new" eigenvalues. We conjecture that every dregular graph has a 2lift such that all new eigenvalues are in the range [ 2 d 1; 2 d 1] (If true, this is tight , e.g. by the AlonBoppana bound). Here we show that every graph of maximal degree d has a 2lift such that all \new" eigenvalues are in the range [ c d; c d] for some constant c.