The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sublinear-time distributed algorithms for detecting small cliques and even cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Three notes on distributed property testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond / rank | |||
Normal rank | |||
Revision as of 13:20, 4 December 2024
scientific article; zbMATH DE number 7824308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs |
scientific article; zbMATH DE number 7824308 |
Statements
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (English)
0 references
26 March 2024
0 references
distributed approximation
0 references
low-diameter decomposition
0 references
LOCAL model
0 references
0 references
0 references
