A New 3/2-Approximation Algorithm for the b-Edge Cover Problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference on Scientific Computing

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/1.9781611974690.ch6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem

  2017cited by this paper
• Designing Scalable b-MATCHING Algorithms on Distributed Memory Multiprocessors by Approximation

  2016cited by this paper
• Efficient Approximation Algorithms for Weighted b-Matching

  2016cited by this paper
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering

  2013cited by this paper
• Adaptive Anonymity via b-Matching

  2013influential reference
• The university of Florida sparse matrix collection

  2011cited by this paper
• Introducing the Graph 500

  2010cited by this paper
• Dynamic programming based algorithms for set multicover and multiset multicover problems

  2010cited by this paper
• Set multi-covering via inclusion-exclusion

  2009cited by this paper
• Inclusion exclusion for hard problems

  2008cited by this paper
• Random Geometric Graphs

  2005cited by this paper
• Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

  2004cited by this paper
• Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

  1999cited by this paper
• The multicovering problem

  1992cited by this paper
• A fast approximation algorithm for the multicovering problem

  1986influential reference
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

  1982influential reference
• A Greedy Heuristic for the Set-Covering Problem

  1979cited by this paper
• On the ratio of optimal integral and fractional covers

  1975cited by this paper
• Approximation algorithms for combinatorial problems

  1973cited by this paper

• Approximation Algorithms for the Geometric Multimatching Problem

  2025cites this paper
• Streaming Matching and Edge Cover in Practice

  2024cites this paper
• Approximate Generalized Matching: f-Matchings and f-Edge Covers

  2022cites this paper
• Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs

  2021cites this paper
• Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs

  2021cites this paper
• New Applications of the Nearest-Neighbor Chain Algorithm

  2019cites this paper
• Approximation algorithms in combinatorial scientific computing

  2019cites this paper
• New Approximation Algorithms for Minimum Weighted Edge Cover

  2018cites this paper
• Adaptive Anonymization of Data using b-Edge Cover

  2018cites this paper
• A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs

  2018cites this paper
• Parallel Algorithms Through Approximation: B-Edge Cover

  2018cites this paper
• Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers

  2017influential citation