Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems

Algorithmica- United States

doi 10.1007/s00453-002-0970-9

Full Text

Abstract

Available in

Date

Authors

Unknown

Publisher

Springer Science and Business Media LLC

Related search

Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2008English

Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme

2019English

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009Norwegian Bokmål

A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1990English

Network Design for Vertex Connectivity

2008English

Multifactorial Evolutionary Algorithm for Clustered Minimum Routing Cost Problem

2019English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

Minimum Cost Flow Based Fast Placement Algorithm

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy