Approximation algorithms for k-connected graph factors

DOI10.1007/978-3-319-28684-6_1MaRDI QIDQ2788985zbMATH OpenOpenAlexFDO

Authors Bodo Manthey, Marten Waanders

Publication date 26 February 2016

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28684-6_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for connected graph factors of minimum weight
• scientific article; zbMATH DE number 1817738
• Improved Approximation Algorithms for Uniform Connectivity Problems
• Survivable network design with degree or order constraints
• An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph

Cited in

(12)

• On a simple randomized algorithm for finding a 2-factor in sparse graphs
• Approximation algorithms for connected graph factors of minimum weight
• On the complexity landscape of connected \(f\)-factor problems
• scientific article; zbMATH DE number 1670548 (Why is no real title available?)
• Vertex Exponential Algorithms for Connected f-Factors
• scientific article; zbMATH DE number 1817738 (Why is no real title available?)
• Approximability of connected factors
• scientific article; zbMATH DE number 1286488 (Why is no real title available?)
• Approximation algorithms for finding low-degree subgraphs
• Improved Approximation Algorithms for Uniform Connectivity Problems
• scientific article; zbMATH DE number 1439499 (Why is no real title available?)
• APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

This page was built for publication: Approximation algorithms for \(k\)-connected graph factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2788985)