CP
2003
Springer
14 years 10 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
COLT
2003
Springer
14 years 10 months ago
2003
Springer
A general class of no-regret learning algorithms, called no-Φ-regret learning algorithms, is defined which spans the spectrum from no-external-regret learning to no-internal-reg...
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
CIAC
2003
Springer
14 years 10 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
CIAC
2003
Springer
14 years 10 months ago
2003
Springer