Pages that link to "Item:Q2933794"
From MaRDI portal
The following pages link to Lower bounds for local approximation (Q2933794):
Displaying 16 items.
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- Node labels in local decision (Q1625609) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Constant space and non-constant time in distributed computing (Q3300833) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- (Q5395734) (redirect page) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
