A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem (Q5178741)
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 6415809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem |
scientific article; zbMATH DE number 6415809 |
Statements
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem (English)
0 references
16 March 2015
0 references
LP rounding
0 references
hydrogen-deuterium exchange
0 references
protein structure
0 references
0.9974733591079712
0 references
0.8535106778144836
0 references
0.8467693328857422
0 references
0.8016573786735535
0 references
0.7946086525917053
0 references
