Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492894
DOI10.1007/11549345zbMath1156.68618OpenAlexW2494705596MaRDI QIDQ5492894
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (6)
Approximation of set multi-cover via hypergraph matching ⋮ Iterative Packing for Demand and Hypergraph Matching ⋮ Combinatorial auctions without money ⋮ Approximation algorithm for the multicovering problem ⋮ Combinatorial auctions with verification are tractable ⋮ Inapproximability of b-Matching in k-Uniform Hypergraphs
This page was built for publication: Mathematical Foundations of Computer Science 2005