位置：成果数据库 > 会议 > 会议详情页
Finding connected dense k-subgraphs
  • 所属机构名称：中国科学院数学与系统科学研究院
  • 会议名称：12th Annual Conference on Theory and Applications of Models of Computation (TAMC)
  • 时间：2015
  • 成果类型：会议
  • 相关项目：运筹学
同会议论文项目
运筹学
期刊论文 13 会议论文 6
同项目会议论文
Excluding Braess's paradox in nonatomic selfish routing
Pricing in social networks with negative externalities
Copula - based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines
How to schedule the marketing of products with negative externalities
Approximability of the Minimum Weighted Doubly Resolving Set Problem