Network design with edge-connectivity and degree constraints
type: Item
instance of: scholarly article
title: Network design with edge-connectivity and degree constraints
zbMATH Open document ID: 1192.68895
author: Takuro Fukunaga
author: Hiroshi Nagamochi
published in: Theory of Computing Systems
publication date: 2009-09-02T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5601532
zbMATH Keywords: appproximation algorithm
zbMATH Keywords: degree constraint
zbMATH Keywords: edge-connectivity
zbMATH Keywords: \((m,n)\)-VRP
zbMATH Keywords: TSP
zbMATH Keywords: vehicle routing problem
MaRDI profile type: Publication
OpenAlex ID: W2151121203
cites work: A polynomial algorithm for b-matchings: An alternative approach
cites work: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: On a theorem of Mader
cites work: APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Survivable network design with degree or order constraints
cites work: Q5187226
cites work: A Reduction Method for Edge-Connectivity in Graphs
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Approximating minimum bounded degree spanning trees to within one of optimal
cites work: Applications of approximation algorithms to cooperative games
cites work: Heuristic analysis, linear programming and branch and bound
DOI: 10.1007/S00224-008-9149-3
description: scientific article; zbMATH DE number 5601532