Journal of the ACM （JOLACM） - Issue 236 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 236 |
| 发布时间： |
| 卷期年份： 2006 |
| 卷期官网： |
本期论文列表
Finding a maximum likelihood tree is hard.
Online algorithms for market clearing.
Combining expert advice in reactive environments.
Using expander graphs to find vertex connectivity.
New hardness results for congestion minimization and machine scheduling.
Logarithmic hardness of the undirected edge-disjoint paths problem.