摘要 : We consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to f... 展开
作者 | Dariusz Dereniowski Danny Dyer |
---|---|
作者单位 | |
期刊名称 | 《Theoretical computer science》 |
总页数 | 13 |
语种/中图分类号 | 英语 / TP30 O1 |
关键词 | Approximation algorithm Graph searching Minimum cost Monotonicity Search strategy |
馆藏号 | N2007EPST0003294 |