16404 search results - page 679 / 3281 » A set coverage problem |
163
click to vote
CCIA
2005
Springer
16 years 23 days ago
2005
Springer
The explanation of the results is a key point of automatic problem solvers. CBR systems solve a new problem by assessing its similarity with already solved cases and they commonly ...
212
click to vote
SIGECOM
2003
ACM
16 years 14 days ago
2003
ACM
We consider the problem of designing mechanisms for online problems in which agents arrive over time and the mechanism is unaware of the agent until the agent announces her arriva...
212
click to vote
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...
201
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
186
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...