The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Add wikidata reference.
 
(3 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4380881055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Dominating Set Approximations beyond Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Distributed Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation of Maximum Independent Set and Maximum Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Distributed Covering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributed Listing of Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximation for Max-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Energy Complexity of Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Energy Complexity of BFS in Radio Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Almost Exact Approximations for Minor-Closed Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for weighted problems in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Strong Diameter Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Maximal Independent Set using Small Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of local distributed graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distributed edge-coloring with fewer colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for local approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: No sublogarithmic-time approximation scheme for bipartite vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Distributed Radio Broadcast Primitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed minimum dominating set approximations in restricted families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing of planarity in the \textsf{CONGEST} model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
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
Property / Wikidata QID
 
Property / Wikidata QID: Q130816751 / rank
 
Normal rank

Latest revision as of 10:38, 16 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
    0 references
    0 references
    26 March 2024
    0 references
    distributed approximation
    0 references
    low-diameter decomposition
    0 references
    LOCAL model
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers