( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Hardness of Pricing Items for Single-Minded Bidders.

, , , и . APPROX-RANDOM, том 5687 из Lecture Notes in Computer Science, стр. 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.

Konstantin Mayerhöfer

Konstantin Karyofilis

Konstantin Kilger

Konstantin Tsironis

Konstantin Koenigs

 

Другие публикации лиц с тем же именем

Online make-to-order joint replenishment model: primal dual competitive algorithms., , , , и . SODA, стр. 952-961. SIAM, (2008)Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection., , , , , , и . AISTATS, том 108 из Proceedings of Machine Learning Research, стр. 3121-3132. PMLR, (2020)Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!, и . CoRR, (2023)How to Play Unique Games on Expanders., и . WAOA, том 6534 из Lecture Notes in Computer Science, стр. 190-200. Springer, (2010)Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering., , и . STOC, стр. 1027-1038. ACM, (2019)Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs.. STACS, том 20 из LIPIcs, стр. 139-147. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Two-Sided Kirszbraun Theorem., , , и . SoCG, том 189 из LIPIcs, стр. 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Robust algorithms with polynomial loss for near-unanimity CSPs., , , , , и . SODA, стр. 340-357. SIAM, (2017)Approximation Algorithm for Sparsest k-Partitioning., и . SODA, стр. 1244-1255. SIAM, (2014)Explainable k-means: don't be greedy, plant bigger trees!, и . STOC, стр. 1629-1642. ACM, (2022)