scientific article; zbMATH DE number 1982180
From MaRDI portal
Publication:4426349
zbMath1023.68880MaRDI QIDQ4426349
Stefan Hougardy, Doratha E. Drake
Publication date: 16 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2647/26470107.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (5)
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ Near Approximation of Maximum Weight Matching through Efficient Weight Reduction ⋮ Efficient Matching for Column Intersection Graphs ⋮ Approximation algorithms in combinatorial scientific computing
This page was built for publication:
