Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.05076OpenAlexW4296156427MaRDI QIDQ5898871

Chor-Ping Low

Publication date: 30 April 2007

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

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

zbMATH Keywords

approximation algorithmbipartite graphsNP-hardload balancingsemi-matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: Theory and Applications of Models of Computation