Pages that link to "Item:Q2905305"
From MaRDI portal
The following pages link to FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305):
Displayed 12 items.
- Max-min weight balanced connected partition (Q386475) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)