Back to Results
First PageMeta Content
NP-complete problems / Combinatorial optimization / Graph connectivity / Matching / Maximum cut / Directed acyclic graph / Cut / Bipartite graph / Graph / Graph theory / Theoretical computer science / Mathematics


On Hardness of Pricing Items for Single-Minded Bidders∗ Rohit Khandekar Tracy Kimbrel Konstantin Makarychev
Add to Reading List

Document Date: 2014-06-08 22:16:35


Open Document

File Size: 173,20 KB

Share Result on Facebook

Company

IBM / Saks / OP T / Microsoft / /

/

IndustryTerm

transportation links / arbitrary optimal solution / canonical solution / 4approximation algorithm / anti-virus software / intended integral solution / approximation algorithm / optimum solution / combinatorial solution / technology products / arbitrary solution / /

OperatingSystem

Microsoft Windows / /

Person

MAX DICUT / Konstantin Makarychev Maxim Sviridenko / Tracy Kimbrel Konstantin Makarychev Maxim / Maximum Acyclic Subgraph / Rohit Khandekar Tracy Kimbrel Konstantin / /

Product

Windows operating system / Windows / /

Technology

operating system / LP-rounding algorithm / anti-virus software / approximation algorithm / 4-approximation algorithm / 4approximation algorithm / /

SocialTag