APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

DOI10.15807/jorsj.50.339zbMath1142.90471OpenAlexW655233204MaRDI QIDQ5385038

Hiroshi Nagamochi, Takuro Fukunaga

Publication date: 29 April 2008

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.50.339

zbMATH Keywords

combinatorial optimizationdegree boundapproximation algorithmsplittingnetwork designedge-connectivitydetachment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Vertex degrees (05C07)

Related Items (3)

Network design with edge-connectivity and degree constraints ⋮ Eulerian detachments with local edge-connectivity ⋮ Some Theorems on Detachments Preserving Local-Edge-Connectivity

This page was built for publication: APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)