( en | de | ru )

 

Disambiguation of "Makarychev, Konstantin"

Author of the publication

copydeleteadd this publication to your clipboard
On Hardness of Pricing Items for Single-Minded Bidders.

, , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 202-216. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Konstantin Thress

Konstantin Pussep

Konstantin Meskouris

Konstantin Heinroth

Konstantin Glaum

 

Other publications of authors with the same name

Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering., , and . STOC, page 1027-1038. ACM, (2019)Improved algorithms for Correlation Clustering with local objectives., , and . CoRR, (2019)Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs.. STACS, volume 20 of LIPIcs, page 139-147. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Online make-to-order joint replenishment model: primal dual competitive algorithms., , , , and . SODA, page 952-961. SIAM, (2008)Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms., , , , and . Operations Research, 61 (4): 1014-1029 (2013)Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs., , , and . CoRR, (2014)How to Play Unique Games against a Semi-Random Adversary, , and . CoRR, (2011)Conditionally independent random variables, and . CoRR, (2005)How to Play Unique Games on Expanders., and . WAOA, volume 6534 of Lecture Notes in Computer Science, page 190-200. Springer, (2010)Robust algorithms with polynomial loss for near-unanimity CSPs., , , , , and . SODA, page 340-357. SIAM, (2017)