Sciweavers

1215 search results - page 240 / 243
» Combinatorics
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 9 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
CSR
2008
Springer
14 years 9 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
DAM
2008
68views more  DAM 2008»
14 years 9 months ago
Multiple packing in sum-type metric spaces
We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric. 1 Consider the space Qn of n-tuples over a finite set Q ...
Rudolf Ahlswede, Vladimir Blinovsky
MP
2006
142views more  MP 2006»
14 years 9 months ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk