Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492894zbMATH OpenOpenAlexFDO

Authors Piotr Krysta

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Price of anarchy for greedy auctions
• Approximation techniques for utilitarian mechanism design
• Equilibria of greedy combinatorial auctions
• Truthful Mechanisms via Greedy Iterative Packing
• Approximation techniques for utilitarian mechanism design

Cited in

(9)

• Approximation algorithm for the multicovering problem
• Approximation of set multi-cover via hypergraph matching
• Combinatorial auctions with verification are tractable
• Iterative packing for demand and hypergraph matching
• Inapproximability of b-matching in k-uniform hypergraphs
• scientific article; zbMATH DE number 1305498 (Why is no real title available?)
• Combinatorial auctions without money
• Engineering hypergraph b-matching algorithms
• On a posterior evaluation of a simple greedy method for set packing

This page was built for publication: Mathematical Foundations of Computer Science 2005

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