Pages that link to "Item:Q839639"
From MaRDI portal
The following pages link to Network design with edge-connectivity and degree constraints (Q839639):
Displaying 8 items.
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Design networks with bounded pairwise distance (Q2819606) (← links)
- The phases of large networks with edge and triangle constraints (Q4596129) (← links)
- (Q4982363) (← links)
- (Q5296365) (← 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)
- Network Design with Edge-Connectivity and Degree Constraints (Q5443519) (← links)