1486 search results - page 112 / 298 » Algorithms for two-box covering |
136
Voted
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
145
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
116
click to vote
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
131
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
126
click to vote
COR
2008
15 years 4 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...