Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Claire Kenyon-Mathieu"'
Autor:
Claire Kenyon-Mathieu, Aparna Das
Publikováno v:
Theory of Computing Systems. 45:497-511
Given a data set in a metric space, we study the problem of hierarchical clustering to minimize the maximum cluster diameter, and the hierarchical k-supplier problem with customers arriving online. We prove that two previously known algorithms for hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::928df624188dacd14cf2bc6e5ce9c4af
https://doi.org/10.1007/s00224-009-9186-6
https://doi.org/10.1007/s00224-009-9186-6
Autor:
Marek Chrobak, Claire Kenyon-Mathieu
Publikováno v:
ACM SIGACT News. 37:115-126
We discuss what we refer to, tentatively, as the "doubling" method for designing online and offline approximation algorithms. The rough idea is to use geometrically increasing estimates on the optimal solution to produce fragments of the algorithm's
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35afc65dd91915fd51535c610a8aa689
https://doi.org/10.1145/1189056.1189078
https://doi.org/10.1145/1189056.1189078
Autor:
Matthew Cary, Aparna Das, Benjamin G. Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Claire Kenyon Mathieu, Michael Schwarz
How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and robustness properties of various strategies. In particular,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7e280402a9c3d481a07f8f511883245
http://www.nber.org/papers/w13788.pdf
http://www.nber.org/papers/w13788.pdf
Publikováno v:
Automata, Languages and Programming ISBN: 9783540734192
ICALP
ICALP
We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is in the second stage costs of the edges, in the other version the uncertainty is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c198e9a07e9202feb762d088bd27dbb
https://doi.org/10.1007/978-3-540-73420-8_17
https://doi.org/10.1007/978-3-540-73420-8_17
Autor:
Warren Schudy, Claire Kenyon-Mathieu
Publikováno v:
STOC
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for Kemeny-Young rank aggregation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afc31d9cb4f35e20fbcf544395a56f49
https://doi.org/10.1145/1250790.1250806
https://doi.org/10.1145/1250790.1250806
Publikováno v:
Theoretical Computer Science. (2-3):213-223
We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version, the uncertainty is in the second stage costs of the edges, and in the other version, the uncertain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b46c9502e3993451f3678c033fb4e255
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.