Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834)
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: Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems |
scientific article; zbMATH DE number 7902426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems |
scientific article; zbMATH DE number 7902426 |
Statements
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (English)
0 references
27 August 2024
0 references
integer linear programming
0 references
counting problem
0 references
parameterized complexity
0 references
multipacking
0 references
multicover
0 references
stable set
0 references
vertex cover
0 references
dominating set
0 references
multiset multicover
0 references
hypergraph matching
0 references
sparse matrix
0 references
0 references
0 references
0 references
0 references
0 references
0 references
