首页> 外文OA文献 >Improved approximations for tour and tree covers

【2h】

Improved approximations for tour and tree covers

机译：改进了游览和树木覆盖的近似值

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Jochen Könemann; Goran Konjevod; Ojas Parekh; Amitabh Sinhay;
展开▼
作者单位

展开▼
年度 2008
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Improved Approximations for Tour and Tree Covers [J] . Jochen Konemann, Goran Konjevod, Ojas Parekh, Algorithmica . 2004,第3期

机译：改进的游览和树木覆盖率近似值
2. Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems [J] . M. Reza Khani, Mohammad R. Salavatipour Algorithmica . 2014,第2期

机译：最小-最大树覆盖和有界树覆盖问题的改进的近似算法
3. A 2-approximation NC algorithm for connected vertex cover and tree cover [J] . Toshihiro Fujito, Takashi Doi Information Processing Letters . 2004,第2期

机译：顶点覆盖和树覆盖的2近似NC算法
4. Improved approximations for tour and tree covers [C] . Jochen Konemann, Goran Konjevod, Ojas Parekh, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems . 2000

机译：改进旅游和树木覆盖的近似值
5. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k,2)-subgraph [D] . Khani, Mohammad Reza 2011

机译：改进的最小-最大树覆盖，有界树覆盖，浅光和批量购买k-Steiner树以及（k，2）-子图近似算法
6. Numerical study on adjusting parameters to improve gaze estimation using planar approximations from electro-oculogram signal voltage ratios [O] . Fumihiko Ishida, Koki Wakata 2019

机译：基于眼电位信号电压比的平面近似调整参数以改善注视估计的数值研究
7. Improved Approximations for Tour and Tree Covers [O] . Jochen Könemann, Goran Konjevod, Ojas Parekh, 2007

机译：改进了游览和树木覆盖的近似值
8. Improved Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. [R] . Awerbuch, B., Azar, Y., Blum, A. 1994

机译：改进了最小权重k树和奖品采购员的近似保证。

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号