OPTIMAL-TIME ALGORITHM FOR THE k-NODE-CONNECTIVITY AUGMENTATION PROBLEM FOR TERNARY TREES.

被引：0

|

作者：

Masuzawa, Toshimitsu ^{[1
]}

Hagihara, Ken'ichi ^{[1
]}

Tokura, Nobuki ^{[1
]}

Wada, Koichi ^{[1
]}

机构：

[1] Osaka Univ, Toyonaka, Jpn, Osaka Univ, Toyonaka, Jpn

来源：

| 1600年 / 17期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

MATHEMATICAL TECHNIQUES

引用

收藏

相关论文

共 6 条

[1] AN OPTIMAL TIME ALGORITHM FOR THE K-VERTEX-CONNECTIVITY UNWEIGHTED AUGMENTATION PROBLEM FOR ROOTED DIRECTED TREES
MASUZAWA, T
HAGIHARA, K
TOKURA, N
DISCRETE APPLIED MATHEMATICS, 1987, 17 (1-2) : 67 - 105
[2] An NC approximation algorithm for optimal k-edge connectivity augmentation
Liang, WF
McKay, BD
FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, : 290 - 295
[3] AN O (n log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES
Wang, Haitao
Zhang, Jingru
SIAM JOURNAL ON COMPUTING, 2021, 50 (02) : 602 - 635
[4] A polynomial-time exact algorithm for the connected k-facility location problem on trees
Ding, Wei
Chen, Guangting
Zhou, Yu
Qiu, Ke
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
[5] Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm
Chiu, CC
Yeh, YS
Chen, RS
COMPUTER COMMUNICATIONS, 2000, 23 (01) : 84 - 91
[6] An optimal randomized online algorithm for the k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-Canadian Traveller Problem on node-disjoint paths
Marco Bender
Stephan Westphal
Journal of Combinatorial Optimization, 2015, 30 (1) : 87 - 96