406 search results - page 73 / 82 » Pseudorandomness and Combinatorial Constructions |
107
Voted
JGAA
2010
14 years 11 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
109
click to vote
MICS
2010
14 years 11 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
113
click to vote
ICTAI
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
105
Voted
PROPERTYTESTING
2010
14 years 10 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
109
Voted
CP
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...