...
机译:增长有界图中最小加权支配集的PTAS
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;
Department of Mathematics, Xi'an Jiaotong University, Xi'an 710049, People's Republic of China;
Dankook University, Seoul, Korea;
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;
approximation algorithm; graph theory; PTAS; dominating set;
机译:增长有界图中路径成本受限的最小连通支配集的PTAS。
机译:增长界图中最小d跳连接支配集的PTAS
机译:增长界图中最小d跳连接支配集的PTAS
机译:单位磁盘图中最低主导集合问题的PTA
机译:具有唯一的最小定位控制集的树
机译:Ad Hoc传感器网络的最小连通支配集算法
机译:单位磁盘图上最小加权支配集和最小加权连通支配集的新近似值