## Abstract

We present a deterministic distributed 2-approximation algorithm for the Minimum Weight Vertex Cover problem in the CON-GEST model whose round complexity is O(log n log Δ/ log ^{2} log Δ). This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the (2 + ɛ)-approximation algorithm of [BCS17], improving the dependency on ɛ ^{−1} from linear to logarithmic. In addition, for every ɛ = (logΔ) ^{−c} , where c ≥ 1 is a constant, our algorithm computes a (2 + ɛ)-approximation in O(log Δ/ log log Δ) rounds (which is asymptotically optimal).

Original language | English |
---|---|

Title of host publication | 25th International Colloquium, SIROCCO 2018, Revised Selected Papers |

Editors | Zvi Lotker, Boaz Patt-Shamir |

Publisher | Springer Verlag |

Pages | 226-236 |

Number of pages | 11 |

ISBN (Print) | 9783030013240 |

DOIs | |

State | Published - 2018 |

Event | 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 - Ma’ale HaHamisha, Israel Duration: 18 Jun 2018 → 21 Jun 2018 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 11085 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 |
---|---|

Country/Territory | Israel |

City | Ma’ale HaHamisha |

Period | 18/06/18 → 21/06/18 |

## Fingerprint

Dive into the research topics of 'A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log^{2}log Δ) rounds'. Together they form a unique fingerprint.