Fast practical solution of sorting by reversals
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic ordering for a parallel block-Jacobi SVD algorithm
Parallel Computing - Parallel matrix algorithms and applications
A simple approximation algorithm for the weighted matching problem
Information Processing Letters
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Journal of Experimental Algorithmics (JEA)
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Incremental assignment problem
Information Sciences: an International Journal
Strategies for improving the parametric yield and profits of 3D ICs
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Parametric yield management for 3D ICs: Models and strategies for improvement
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Analysis and approximation of optimal co-scheduling on chip multiprocessors
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
Resource overbooking and application profiling in a shared Internet hosting platform
ACM Transactions on Internet Technology (TOIT)
From pervasive to social computing: algorithms and deployments
Proceedings of the 2009 international conference on Pervasive services
Heuristics for the mixed swapping problem
Computers and Operations Research
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
Spectral-Driven Isometry-Invariant Matching of 3D Shapes
International Journal of Computer Vision
Data preservation under spatial failures in sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Array regrouping on CMP with non-uniform cache sharing
LCPC'10 Proceedings of the 23rd international conference on Languages and compilers for parallel computing
Geography- and infrastructure-aware topology design methodology for broadband access networks (FTTx)
Photonic Network Communications
Threshold error rates for the toric and planar codes
Quantum Information & Computation
Graphical algorithms and threshold error rates for the 2d color code
Quantum Information & Computation
Test Planning in Digital Microfluidic Biochips Using Efficient Eulerization Techniques
Journal of Electronic Testing: Theory and Applications
Scheduling mobile collaborating workforce for multiple urgent events
Journal of Network and Computer Applications
On degree constrained shortest paths
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
On approximating the maximum simple sharing problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Progressive decomposition of point clouds without local planes
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
Match twice and stitch: a new TSP tour construction heuristic
Operations Research Letters
Isometry-invariant matching of point set surfaces
EG 3DOR'08 Proceedings of the 1st Eurographics conference on 3D Object Retrieval
Progressive compression of point-sampled models
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
In-placement clock-tree aware multi-bit flip-flop generation for power optimization
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect matching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the use of multiple search trees with an individual dual-change ε for each tree. As a benchmark of the algorithm's performance, solving a 100,000-node geometric instance on a 200 Mhz Pentium-Pro computer takes approximately 3 minutes.