Approximation algorithms for connected graph factors of minimum weight

Recommendations

Cites work

scientific article; zbMATH DE number 3639144 (Why is no real title available?)
A Short Proof of the Factor Theorem for Finite Graphs
A unified algorithm for degree bounded survivable network design
Additive Approximation for Bounded Degree Survivable Network Design
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
Approximability of connected factors
Approximating minimum bounded degree spanning trees to within one of optimal
Approximating node connectivity problems via set covers
Approximation Algorithms for Network Design with Metric Costs
Approximation algorithms for \(k\)-connected graph factors
Approximation and exact algorithms for special cases of connected \(f\)-factors
Biconnectivity approximations and graph carvings
Degree bounded network design with metric costs
Heuristic analysis, linear programming and branch and bound
Matching theory
Network design with edge-connectivity and degree constraints
Network design with weighted degree constraints
On some network design problems with degree constraints
Optimization, approximation, and complexity classes
Survivable network design with degree or order constraints
Survivable networks, linear programming relaxations and the parsimonious property
The Traveling Salesman Problem with Distances One and Two
The complexity of regular subgraph recognition
The design of approximation algorithms

Cited in

(11)

Improved Approximation Algorithms for Uniform Connectivity Problems
Approximating bounded-degree spanning trees and connected factors with leaves
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Approximability of connected factors
Approximation and exact algorithms for special cases of connected \(f\)-factors
scientific article; zbMATH DE number 1670548 (Why is no real title available?)
Approximation algorithms for finding low-degree subgraphs
Approximation algorithms for \(k\)-connected graph factors
On the complexity landscape of connected \(f\)-factor problems
Better algorithms for minimum weight vertex-connectivity problems
Vertex Exponential Algorithms for Connected f-Factors

This page was built for publication: Approximation algorithms for connected graph factors of minimum weight