1298 search results - page 25 / 260 » The online set cover problem |
TCS
2008
14 years 9 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
102
click to vote
AI
2001
Springer
15 years 2 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
AUIC
2006
IEEE
15 years 3 months ago
2006
IEEE
We performed a usability evaluation of four New Zealand university online library catalogues. The evaluation found severe usability problems with online catalogues—we found so m...
128
click to vote
DAM
2011
14 years 4 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
WG
2007
Springer
15 years 3 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...