A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs (Q3098085)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5970683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs |
scientific article; zbMATH DE number 5970683 |
Statements
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs (English)
0 references
11 November 2011
0 references
approximation algorithm
0 references
non-separating path
0 references
connected partition
0 references
grid graph
0 references
0.8756611347198486
0 references
0.8474446535110474
0 references
0.8343937993049622
0 references
0.8263067603111267
0 references
0.8261769413948059
0 references
