1486 search results - page 42 / 298 » Algorithms for two-box covering |
105
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
AAIM
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
111
click to vote
WIA
1998
Springer
15 years 5 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
88
Voted
AIIDE
2008
15 years 3 months ago
2008
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...