Algorithms and time complexity of the request-service problem (Q711403)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms and time complexity of the request-service problem |
scientific article; zbMATH DE number 5805916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and time complexity of the request-service problem |
scientific article; zbMATH DE number 5805916 |
Statements
Algorithms and time complexity of the request-service problem (English)
0 references
26 October 2010
0 references
disjoint cycle cover
0 references
MAX2SAT
0 references
0.6984424591064453
0 references
0.6679317951202393
0 references
0.6679317951202393
0 references
0.6668675541877747
0 references
0.6619002223014832
0 references
