合 作 者
期刊 & 会议
年  份
 
Carsten Moldenhauer 的论文(9) 排序方式:
Evaluating Strategies for Running from the Cops  
Moving target search (MTS) or the game of cops and robbers has a broad field of application reaching from law enforcement to computer games. Within the recent years research has focused on computing m......
International Joint Conference on Artificial Intelligence  2009
3次引用 0 0
Optimal Solutions for Moving Target Search (Extended Abstract)  
Moving target search or the game of cops and robbers has been given much attention during the last two decades. It is known that optimal solutions, given a n-cop-win graph, are computable in polynomia......
Adaptive Agents and Multi-Agents Systems  2009
3次引用 0 0
Optimal solutions for moving target search  
Moving target search or the game of cops and robbers has been given much attention during the last two decades. It is known that optimal solutions, given an-cop-win graph, are computable in polynomial......
Autonomous Agents and Multiagent Systems/Agent Theories, Architectures, and Languages  2009
2次引用 0 0
Single-Frontier Bidirectional Search  
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often fall far short of exp......
National Conference on Artificial Intelligence  2010
0次引用 0 0
On largest volume simplices and sub-determinants  
We show that the problem of finding the simplex of largest volume in the convex hull ofnpoints inQdcan be approximated with a factor ofO(logd)d/2in polynomial time. This improves upon the previously b......
Symposium on Discrete Algorithms  2015
0次引用 0 0
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs  
Node-Weighted Steiner Forest is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find a minimum weight set of vertices that inc......
Information and Computation/information and Control  2013
0次引用 0 0
Balanced Interval Coloring  
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two colors is minimal. Some......
Symposium on Theoretical Aspects of Computer Science  2011
0次引用 0 0
Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs  
International Colloquium on Automata, Languages and Programming  2011
0次引用 0 0
Balanced Interval Coloring  
We consider the discrepancy problem of coloring $n$ intervals with $k$ colors such that at each point on the line, the maximal difference between the number of intervals of any two colors is minimal. ......
Computing Research Repository  2010
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜