Amanote Research
Register
Sign In
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
Algorithmica
- United States
doi 10.1007/s00453-002-0970-9
Full Text
Open PDF
Abstract
Available in
full text
Categories
Applied Mathematics
Computer Science Applications
Computer Science
Date
September 1, 2002
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 Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems
Journal of the Operations Research Society of Japan
Management Science
Decision Sciences
Operations Research
Network Design for Vertex Connectivity
Multifactorial Evolutionary Algorithm for Clustered Minimum Routing Cost Problem
Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem
Journal of the Operations Research Society of Japan
Management Science
Decision Sciences
Operations Research
Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems
Journal of Inequalities and Applications
Combinatorics
Applied Mathematics
Analysis
Discrete Mathematics
An Algorithm for the Quadratic Approximation
Journal of Computational and Applied Mathematics
Computational Mathematics
Applied Mathematics
