Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs (Q5700571): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s009753970139567x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088647669 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:30, 30 July 2024
scientific article; zbMATH DE number 2220461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs |
scientific article; zbMATH DE number 2220461 |
Statements
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs (English)
0 references
28 October 2005
0 references
combinatorial optimization
0 references
NP-hardness
0 references
approximation algorithms
0 references
polynomial time approximation schemes
0 references
graph bisection
0 references
planar graphs
0 references
