Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Fast parallel algorithms for graph matching problems
Fast parallel algorithms for graph matching problems
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
A simple approximation algorithm for the weighted matching problem
Information Processing Letters
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A simpler linear time 2/3 - ε approximation for maximum weight matching
Information Processing Letters
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
ACM SIGCOMM Computer Communication Review
Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
A new diffusion-based multilevel algorithm for computing graph partitions
Journal of Parallel and Distributed Computing
Maximum weighted matching using the partitioned global address space model
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Entry Pairing in Inverted File
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Rate Control, Routing Algorithm and Scheduling for Multicast with Network Coding in Ad Hoc Networks
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
IEEE/ACM Transactions on Networking (TON)
Cross-layer rate control and dynamic scheduling in mobile ad hoc networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Engineering algorithms for approximate weighted matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A parallel approximation algorithm for the weighted maximum matching problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
A simple parallel approximation algorithm for maximum weight matching
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
On distributed scheduling in wireless networks exploiting broadcast and network coding
IEEE Transactions on Communications
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Cross-layer design in multihop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
Assignment problems in rental markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Finding graph matchings in data streams
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Linear time algorithms for generalized edge dominating set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
IEEE/ACM Transactions on Networking (TON)
Parallel community detection for massive graphs
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Adaptive distributed b-matching in overlays with preferences
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
A multithreaded algorithm for network alignment via approximate matching
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Approximate weighted matching on emerging manycore and multithreaded architectures
International Journal of High Performance Computing Applications
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
PDQ: Parallel Distance Queries for deformable meshes
Graphical Models
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.00 |
A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is presented. It calculates a matching with an edge weight of at least 1/2 of the edge weight of a maximum weighted matching. Its time complexity is O(|E|), with |E| being the number of edges in the graph. This improves over the previously known 1/2 -approximation algorithms for maximum weighted matching which require O(|E| ċ log(|V|)) steps, where |V| is the number of vertices.