Pages that link to "Item:Q5361863"
From MaRDI portal
The following pages link to Approximating connectivity domination in weighted bounded-genus graphs (Q5361863):
Displaying 4 items.
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
