479 research outputs found
A Simple Linear Time Algorithm for Computing a 1-Median on Cactus Graphs
We address the problem of finding a 1-median on a cactus graph. The problem has already been solved in linear time by the algorithms of Burkard and Krarup (1998), and Lan and Wang (2000). These algorithms are complicated and need efforts. Hence, we develop in this paper a simpler algorithm. First, we construct a condition for a cycle that contains a 1-median or for a vertex that is indeed a 1-median of the cactus. Based on this condition, we localize the search for deriving a 1-median on the underlying cactus. Complexity analysis shows that the approach runs in linear time
An optimal algorithm for the weighted backup 2-center problem on a tree
In this paper, we are concerned with the weighted backup 2-center problem on
a tree. The backup 2-center problem is a kind of center facility location
problem, in which one is asked to deploy two facilities, with a given
probability to fail, in a network. Given that the two facilities do not fail
simultaneously, the goal is to find two locations, possibly on edges, that
minimize the expected value of the maximum distance over all vertices to their
closest functioning facility. In the weighted setting, each vertex in the
network is associated with a nonnegative weight, and the distance from vertex
to is weighted by the weight of . With the strategy of
prune-and-search, we propose a linear time algorithm, which is asymptotically
optimal, to solve the weighted backup 2-center problem on a tree.Comment: 14 pages, 4 figure
Community structure in industrial SAT instances
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there have been some attempts to analyze the structure of industrial SAT instances in terms of complex networks, with the aim of explaining the success of SAT solving techniques, and possibly improving them.
In this paper, we study the community structure, or modularity, of industrial SAT instances. In a graph with clear community structure, or high modularity, we can find a partition of its nodes into communities such that most edges connect variables of the same community. Representing SAT instances as graphs, we show that most application benchmarks are characterized by a high modularity. On the contrary, random SAT instances are closer to the classical Erdös-Rényi random graph model, where no structure can be observed. We also analyze how this structure evolves by the effects of the execution of a CDCL SAT solver, and observe that new clauses learned by the solver during the search contribute to destroy the original structure of the formula. Motivated by this observation, we finally present an application that exploits the community structure to detect relevant learned clauses, and we show that detecting these clauses results in an improvement on the performance of the SAT solver. Empirically, we observe that this improves the performance of several SAT solvers on industrial SAT formulas, especially on satisfiable instances.Peer ReviewedPostprint (published version
A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS
This paper investigatesthe classical -median location problem in a network in which some of the vertex weights and the distances between vertices are uncertain and while others are random. For solving the -median problem in an uncertain random network, an optimization model based on the chance theory is proposed first and then an algorithm is presented to find the -median. Finally, a numerical example is given to illustrate the efficiency of the proposed metho
- …