Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
From MaRDI portal
Publication:2111532
Recommendations
- Approximation algorithms for the maximum bounded connected bipartition problem
- A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
- Approximation algorithm for the balanced 2-connected bipartition problem
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Approximation algorithms for maximally balanced connected graph partition
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3315017 (Why is no real title available?)
- A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
- A common approximation framework for early work, late work, and resource leveling problems
- A heuristic algorithm for the mini-max spanning forest problem
- A parallel machine scheduling problem maximizing total weighted early work
- A polynomial-time algorithm for max-min partitioning of ladders
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Approximation algorithms for maximally balanced connected graph partition
- Approximation algorithms for the maximally balanced connected graph tripartition problem
- Approximation algorithms for the maximum bounded connected bipartition problem
- Approximation and inaproximability results on balanced connected partitions of graphs
- Bounds for Certain Multiprocessing Anomalies
- Computing an st-numbering
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- Max-min partitioning of grid graphs into connected components
- Most uniform path partitioning and its use in image processing
- Online early work maximization problem on two hierarchical machines with buffer or rearrangements
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
- Shifting algorithms for tree partitioning with general weighting functions
Cited in
(10)- Approximation algorithms for the maximum bounded connected bipartition problem
- scientific article; zbMATH DE number 3902687 (Why is no real title available?)
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Approximation algorithm for the balanced 2-connected bipartition problem
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
- Approximation algorithms for approximating graphs with bounded number of connected components
- scientific article; zbMATH DE number 6288786 (Why is no real title available?)
This page was built for publication: Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111532)
