首页> 外文OA文献 >An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs

【2h】

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs

机译：最小尺寸的两边连接生成子图的一种改进的近似算法

页面导航

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

著录项

作者
Sebo Cheriyan; J. Cheriyan; Z. Szigeti;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem [J] . Hunkenschroeder Christoph, Vempala Santosh, Vetta Adrian ACM transactions on algorithms . 2019,第4期

机译：一个4/3近似算法，用于最小2边缘连接的子图问题
2. A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs [J] . Takazawa Kenjiro Information Processing Letters . 2016,第9期

机译：二分立方图中最小2边连通子图问题的7/6逼近算法
3. TOWARD A 6/5 BOUND FOR THE MINIMUM COST 2-EDGE CONNECTED SPANNING SUBGRAPH [J] . Boyd Sylvia, Legault Philippe SIAM Journal on Discrete Mathematics . 2017,第1期

机译：成本最低的2边缘连通跨子图的6/5边界
4. An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs [C] . Joseph Cheriyan, Andras Sebo, Zoltan Szigeti International conference on integer programming and combinatorial optimization;IPCO . 1998

机译：最小尺寸两边连接生成子图的一种改进的近似算法
5. Approaches to approximating the minimum weight k-edge connected spanning subgraph of a mixed graph. [D] . Scheder, Dominik Alban. 2005

机译：逼近混合图的最小权重k边连接的跨子图的方法。
6. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm Minimum Spanning Tree and Hierarchical Clustering in an Applied Study [O] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, 2020

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法最小生成树和分层聚类的三种混合方法的比较
7. Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph [O] . J. Cheriyan, A. Sebö, Z. Szigeti 1999

机译：改进最小的2边连通跨越子图的1.5近似
8. Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. [R] . Pop, P. C., Kern, W., Still, G. 2001

机译：有界簇尺寸广义最小生成树问题的逼近算法。

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs

著录项

引文网络

相似文献

相关主题

期刊订阅