3082 search results - page 102 / 617 » New Bounds for the Controller Problem |
154
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
159
click to vote
LATA
2010
Springer
16 years 3 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
173
click to vote
CCCG
2008
15 years 7 months ago
2008
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
175
click to vote
MOR
2010
15 years 4 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
150
click to vote
FOCS
2006
IEEE
16 years 7 days ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...