Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences - United States
doi 10.1016/j.jcss.2007.05.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Combined Connectivity Augmentation and Orientation Problems

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Logic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization Problems

Industrial & Engineering Chemistry Research
ChemistryChemical EngineeringManufacturing EngineeringIndustrial
2014English

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2014English

A Nonlinear Lagrange Algorithm for Stochastic Minimax Problems Based on Sample Average Approximation Method

Journal of Applied Mathematics
Applied Mathematics
2014English

Compatible Connectivity-Augmentation of Planar Disconnected Graphs

2014English

Maximum Algebraic Connectivity Augmentation Is NP-hard

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy