Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710048zbMATH OpenOpenAlexFDO

Authors Justus Schwartz, Angelika Steger, Andreas Weißl

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• Optimum matchings in weighted bipartite graphs
• Fast and Simple Algorithms for Weighted Perfect Matching
• Weighted Bipartite Matching in Matrix Multiplication Time
• Maximum weight bipartite matching in matrix multiplication time
• A scaling algorithm for maximum weight matching in bipartite graphs

Cited in

(14)

• Maximum weight bipartite matching in matrix multiplication time
• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• Fast and Simple Algorithms for Weighted Perfect Matching
• Weighted Bipartite Matching in Matrix Multiplication Time
• Inexpensive d‐dimensional matchings
• A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
• Dynamic discrete tomography
• Bipartite matching with linear edge weights
• A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
• A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
• A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
• A least-squares minimum-cost network flow algorithm
• Deterministic and universal truthful mechanism for fair matching
• Tourism resilience from networks: diversity and hierarchy

This page was built for publication: Experimental and Efficient Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710048)