13987 search results - page 308 / 2798 » The Two Guards Problem |
195
Voted
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
190
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
267
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
155
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic p...
164
click to vote
WSC
2008
15 years 9 months ago
2008
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...