Algorithms for intersection graphs for \(t\)-intervals and \(t\)-pseudodisks (Q5093404)
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 7563820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for intersection graphs for \(t\)-intervals and \(t\)-pseudodisks |
scientific article; zbMATH DE number 7563820 |
Statements
26 July 2022
0 references
approximation algorithms
0 references
multiple interval graphs
0 references
geometric set cover
0 references
dominating set
0 references
independent set
0 references
0.818123996257782
0 references
0.8159107565879822
0 references
0.8141648173332214
0 references
0.7796139717102051
0 references
0.7725173234939575
0 references
