位置：成果数据库 > 会议 > 会议详情页
Efficient algorithms for k-disjoint paths problems on DAGs
  • 所属机构名称：复旦大学
  • 会议名称：3rd International Conference on Algorithmic Aspects in Information and Management (AAIM 2007)
  • 成果类型：会议
  • 会场：Portland
  • 相关项目：自主机器人在线算法
作者： Zhu, Hong|Ge, Qi|Li, Jian|FLEISCHER, Rudolf|
同会议论文项目
自主机器人在线算法
期刊论文 11 会议论文 19 著作 1
同项目会议论文
On approximating the maximum simple sharing problem
Alternative Models of Computation
Competitive online searching for a ray in the plane
Die another day
Traversing the machining graph
Executive Summary - Robot Navigation
A generic top-down dynamic-programming approach to prefix-free coding
Die another day
Non-metric multicommodity and multilevel facility location
Some little combinatorial problems in discrete geometry and on graphs
Dynamic Pareto optimal matching
Online problems in robotics
Multilinear tensor-based non-parametric dimension reduction for gait recognition
Search and exploration of unknown graphs
Approximating the maximum sharing problem
Geometric shape matching
Die another day
Algorithms for core stability, core largeness, exactness, and extendability of flow games