Results 1  10
of
23
Generating satisfiable problem instances
 In AAAI/IAAI
, 2000
"... A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem generat ..."
Abstract

Cited by 84 (9 self)
 Add to MetaCart
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem generator and a complete search method to filter out the unsatisfiable instances. Unfortunately, this approach cannot be used to create problem instances that are beyond the reach of complete search methods. So far, it has proven to be surprisingly difficult to develop a direct generator for satisfiable instances only. In this paper, we propose a generator that only outputs satisfiable problem instances. We also show how one can finely control the hardness of the satisfiable instances by establishing a connection between problem hardness and a new kind of phase transition phenomenon in the space of problem instances. Finally, we use our problem distribution to show the easyhardeasy pattern in search complexity for local search procedures, analogous to the previously reported pattern for complete search methods.
Distributed Construction of Random Expander Networks
 In IEEE Infocom
, 2003
"... We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globallyknown server is required. The constructed topologies are expanders with O(log d n) diameter with high probability. ..."
Abstract

Cited by 84 (0 self)
 Add to MetaCart
We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globallyknown server is required. The constructed topologies are expanders with O(log d n) diameter with high probability.
Structural and Algorithmic Aspects of Massive Social Networks
 in Proceedings of 15th ACMSIAM Symposium on Discrete Algorithms (SODA 2004), 711720, SIAM
, 2004
"... We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact net ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact network is a bipartite graph, with two types of nodes: people and locations; edges represent people visiting locations on a typical day. Three types of results are presented. (i) Our empirical results show that many basic characteristics of the dataset are wellmodeled by a random graph approach suggested by Fan Chung Graham and Lincoln Lu (the CLmodel), with a powerlaw degree distribution. (ii) We obtain fast approximation algorithms for computing
Concentration
, 1998
"... Upper bounds on probabilities of large deviations for sums of bounded independent random variables may be extended to handle functions which depend in a limited way on a number of independent random variables. This ‘method of bounded differences’ has over the last dozen or so years had a great impac ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Upper bounds on probabilities of large deviations for sums of bounded independent random variables may be extended to handle functions which depend in a limited way on a number of independent random variables. This ‘method of bounded differences’ has over the last dozen or so years had a great impact in probabilistic methods in discrete mathematics and in the mathematics of operational research and theoretical computer science. Recently Talagrand introduced an exciting new method for bounding probabilities of large deviations, which often proves superior to the bounded differences approach. In this paper we
On the Chromatic Number of Random Graphs
, 2007
"... In this paper we consider the classical ErdősRényi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ, for any fixed δ>0, the chromatic number χ(Gn,p) is a.a.s. ℓ, ℓ+1, or ℓ+2, where ℓ is the maximum integer satisfying 2(ℓ−1) log(ℓ−1) ≤ p(n−1). ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In this paper we consider the classical ErdősRényi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ, for any fixed δ>0, the chromatic number χ(Gn,p) is a.a.s. ℓ, ℓ+1, or ℓ+2, where ℓ is the maximum integer satisfying 2(ℓ−1) log(ℓ−1) ≤ p(n−1).
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
, 2001
"... . In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) proble ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
. In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known results for these problems. Results for the MVC problem translate immediately to results for the maximum independent set problem. We also derive lower bounds on the size of an optimal MIDS. 1
The smoothed complexity of edit distance
 IN PROC. OF ICALP
, 2008
"... We initiate the study of the smoothed complexity of sequence alignment, by proposing a semirandom model of edit distance between two input strings, generated as follows. First, an adversary chooses two binary strings of length d and a longest common subsequence A of them. Then, every character is ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We initiate the study of the smoothed complexity of sequence alignment, by proposing a semirandom model of edit distance between two input strings, generated as follows. First, an adversary chooses two binary strings of length d and a longest common subsequence A of them. Then, every character is perturbed independently with probability p, except that A is perturbed in exactly the same way inside the two strings. We design two efficient algorithms that compute the edit distance on smoothed instances up to a constant factor approximation. The first algorithm runs in nearlinear time, namely d 1+ε for any fixed ε> 0. The second one runs in time sublinear in d, assuming the edit distance is not too small. These approximation and runtime guarantees are significantly better then the bounds known for worstcase inputs, e.g. nearlinear time algorithm achieving approximation roughly d 1/3, due to Batu, Ergün, and Sahinalp [SODA 2006]. Our technical contribution is twofold. First, we rely on finding matches between substrings in the two strings, where two substrings are considered a match if their edit distance is relatively small, a prevailing technique in commonly used heuristics, such as PatternHunter of Ma, Tromp and Li [Bioinformatics, 2002]. Second, we effectively reduce the smoothed edit distance to a simpler variant of (worstcase) edit distance, namely, edit distance on permutations (a.k.a. Ulam’s metric). We are thus able to build on algorithms developed for the Ulam metric, whose much better algorithmic guarantees usually do not carry over to general edit distance.
Random Geometric Problems on [0, 1]²
 RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE, NUMBER 1518 IN LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... In this paper we survey the work done for graphs on random geometric models. We present some heuristics for the problem of the Minimal Linear Arrangement on [0, 1]² and we conclude with a collection of open problems. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper we survey the work done for graphs on random geometric models. We present some heuristics for the problem of the Minimal Linear Arrangement on [0, 1]² and we conclude with a collection of open problems.