Pages that link to "Item:Q5920611"
From MaRDI portal
The following pages link to Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611):
Displaying 10 items.
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
- Augmenting outerplanar graphs to meet diameter requirements (Q2862552) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Vertex fusion under diameter constraints (Q3503481) (← links)
- Algorithms and Computation (Q5191671) (← links)
