Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Information Processing Letters

• Publication date

  2009-06-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ipl.2009.03.022
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking

  2018cited by this paper
• Improved distributed approximate matching

  2008cited by this paper
• The price of being near-sighted

  2006cited by this paper
• Efficient Distributed Weighted Matchings on Trees

  2006cited by this paper
• A linear-time approximation algorithm for weighted matchings in graphs

  2005cited by this paper
• Distributed Weighted Matching

  2004cited by this paper
• A simpler linear time 2/3-epsilon approximation for maximum weight matching

  2004cited by this paper
• On the distributed complexity of computing maximal matchings

  1997cited by this paper
• Distributed Computing: A Locality-Sensitive Approach

  1987cited by this paper

• Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs

  2018cites this paper