Near-Optimal Asymmetric Binary Matrix Partitions

DOI10.1007/978-3-662-48054-0_1zbMath1387.68294arXiv1407.8170OpenAlexW1558735371MaRDI QIDQ2946372

Fidaa Abed, Alexandros A. Voudouris, Ioannis Caragiannis

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.8170

Mathematics Subject Classification ID

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

Cites Work

• Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
• Inapproximability results for combinatorial auctions with submodular utility functions
• Simplified mechanisms with an application to sponsored-search auctions
• The value of information in a sealed-bid auction
• Tight approximation bounds for combinatorial frugal coverage algorithms
• Combinatorial auctions with decreasing marginal utilities
• The Asymmetric Matrix Partition Problem
• An Improved Approximation Bound for Spanning Star Forest and Color Saving
• Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist when Demands are Interdependent
• Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions
• A Theory of Auctions and Competitive Bidding
• Strategic Information Transmission
• Wavelength Management in WDM Rings to Maximize the Number of Connections
• Unnamed Item
• Unnamed Item

This page was built for publication: Near-Optimal Asymmetric Binary Matrix Partitions