Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L3G1, Canada;
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L3G1, Canada;
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L3G1, Canada;
approximation algorithms; LP rounding; primal-dual method; prize-collecting problems; T-joins; TSP; s; t-path TSP;
机译:近似最小成本的连接T型联接
机译:通过无独立图来逼近最低成本的k结点连接子图?
机译:逼近最小成本边沿覆盖率的最小成本边沿覆盖率
机译:近似最小成本连接的T型连接
机译:近似3个无爪图的周长
机译:MEC辅助排的协作任务执行的最低成本卸载
机译:近似最小成本连接T-Joins