Pages that link to "Item:Q1751155"
From MaRDI portal
The following pages link to Covering problems in edge- and node-weighted graphs (Q1751155):
Displaying 12 items.
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- On the weighted complexity of a regular covering of a graph (Q1410729) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Weighted consensus problem for multiagent systems with edge- and node-weighted directed graphs (Q2336027) (← links)
- A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
- Linear programming and primal-dual problems in graph theory (Q2868311) (← links)
- (Q3100107) (← links)
- (Q3188896) (redirect page) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)