Secure Maximum Weight Matching Approximation on General Graphs
Abstract
References
Index Terms
- Secure Maximum Weight Matching Approximation on General Graphs
Recommendations
Maximum weight induced matching in some subclasses of bipartite graphs
AbstractA subset of edges of a graph is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is the same as G[S], the subgraph of G induced ...
An efficient fair UC-secure protocol for two-party computation
With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
Approximating Maximum Weight Matching in Near-Linear Time
FOCS '10: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer ScienceGiven a weighted graph, the {\em maximum weight matching} problem (MWM) is to find a set of vertex-disjoint edges with maximum weight. In the 1960s Edmonds showed that MWMs can be found in polynomial time. At present the fastest MWM algorithm, due to ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/7e9434bd-edd8-443a-8cc3-bce2ef815d0b/3559613.cover.jpg)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
- Deutsche Forschungsgemeinschaft
- European Research Council
- German Federal Ministry of Education and Research and the Hessen State Ministry for Higher Education, Research and the Arts
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 105Total Downloads
- Downloads (Last 12 months)38
- Downloads (Last 6 weeks)2
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in