Degree constrained node-connectivity problems
type: Item
instance of: scholarly article
title: Degree constrained node-connectivity problems
zbMATH Open document ID: 1314.68237
author: Zeev Nutov
published in: Algorithmica
publication date: 2015-01-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6387693
zbMATH Keywords: network design
zbMATH Keywords: node-connectivity
zbMATH Keywords: degree bounds
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s00453-013-9849-1
OpenAlex ID: W1983217642
cites work: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
cites work: Additive Guarantees for Degree-Bounded Directed Network Design
cites work: Degree Bounded Network Design with Metric Costs
cites work: Network design via iterative rounding of setpair relaxations
cites work: An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
cites work: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
cites work: Rooted \(k\)-connections in digraphs
cites work: Minimal edge-coverings of pairs of sets
cites work: An application of submodular flows
cites work: Network design with weighted degree constraints
cites work: Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Network-Design with Degree Constraints
cites work: Improved Approximation Algorithms for Uniform Connectivity Problems
cites work: Approximating node connectivity problems via set covers
cites work: Q5302101
cites work: Survivable Network Design with Degree or Order Constraints
cites work: Iterative Methods in Combinatorial Optimization
cites work: Improved Algorithm for Degree Bounded Survivable Network Design Problem
cites work: Approximating directed weighted-degree constrained networks
cites work: Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
cites work: Degree-Constrained Node-Connectivity
cites work: Approximating minimum bounded degree spanning trees to within one of optimal
DOI: 10.1007/S00453-013-9849-1
description: scientific article; zbMATH DE number 6387693