Pages that link to "Item:Q2111532"
From MaRDI portal
The following pages link to Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532):
Displaying 5 items.
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (Q2905305) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- (Q5412227) (← links)