Local search algorithms for the maximum carpool matching problem (Q5111744)
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: Local search algorithms for the maximum carpool matching problem |
scientific article; zbMATH DE number 7205033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local search algorithms for the maximum carpool matching problem |
scientific article; zbMATH DE number 7205033 |
Statements
27 May 2020
0 references
approximation algorithms
0 references
local search
0 references
star packing
0 references
submodular maximization
0 references
0 references
0 references
0.9971446990966796
0 references
0.941486954689026
0 references
0.7602261304855347
0 references
0.742723822593689
0 references
0.7291979789733887
0 references
