位置：成果数据库 > 会议 > 会议详情页
On approximating the maximum simple sharing problem
  • 所属机构名称：复旦大学
  • 会议名称：17th International Symposium on Algorithms and Computation (ISAAC 2006)
  • 成果类型：会议
  • 会场：Kolkata
  • 相关项目：自主机器人在线算法
作者： Zhu, Hong|Chen, Danny|FLEISCHER, Rudolf|Li, Jian|Xie, Zhiyi|
同会议论文项目
自主机器人在线算法
期刊论文 11 会议论文 19 著作 1
同项目会议论文
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
Efficient algorithms for k-disjoint paths problems on DAGs
Geometric shape matching
Die another day
Algorithms for core stability, core largeness, exactness, and extendability of flow games