On algorithms employing treewidth for \(L\)-bounded cut problems (Q4637663)
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 6864492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On algorithms employing treewidth for \(L\)-bounded cut problems |
scientific article; zbMATH DE number 6864492 |
Statements
On Algorithms Employing Treewidth for $L$-bounded Cut Problems (English)
0 references
25 April 2018
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.7970138192176819
0 references
0.7840905785560608
0 references
0.7769811749458313
0 references
0.774650514125824
0 references
0.7727566957473755
0 references
