Pages that link to "Item:Q1743127"
From MaRDI portal
The following pages link to Approximation algorithms for connected graph factors of minimum weight (Q1743127):
Displaying 6 items.
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- (Q2753746) (← links)
- Vertex Exponential Algorithms for Connected f-Factors (Q2978502) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385038) (← links)