Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700)
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: Polynomial-time data reduction for weighted problems beyond additive goal functions |
scientific article; zbMATH DE number 7656393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time data reduction for weighted problems beyond additive goal functions |
scientific article; zbMATH DE number 7656393 |
Statements
Polynomial-time data reduction for weighted problems beyond additive goal functions (English)
0 references
22 February 2023
0 references
NP-hard problems
0 references
problem kernelization
0 references
weight reduction
0 references
routing
0 references
scheduling
0 references
computational social choice
0 references
partitioning
0 references
0 references
0 references
0 references
0 references
0.85558516
0 references
0.85455763
0 references
0.8488325
0 references
0.84005094
0 references
0.83847666
0 references
0.8294115
0 references
0 references
0.82757294
0 references
