Alexander A. Ageev
Journal of combinatorial optimization · 2004
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 22 researchers here, as inferred from the citation graph.
Whom Alexander A. Ageev trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Alexander A. Ageev overall
- Jan Vondr'ak
- Chandra Chekuri
- Jan Vondr
- Gruia Calinescu
- Maxim Sviridenko
- Negin Golrezaei
- Karthikeyan Shanmugam
- Moran Feldman
- Jennifer Gillenwater
- Nikhil Bansal
Papers from Alexander A. Ageev's perspective
Ordered by how strongly the researchers Alexander A. Ageev trusts endorse each paper. Same corpus, a different order for every researcher.
- The Budgeted Maximum Coverage Problem
- A threshold of ln n for approximating set cover (preliminary version)
- Algorithms for facility location problems with outliers (ACM-SIAM Symposium on Discrete Algorithms)
- Scribe: a large-scale and decentralized application-level multicast infrastructure (IEEE J. Sel. Areas Commun.)
- Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination (International Workshop on Network and Operating System Support for Digital Audio and Video)
- Clustering to Minimize the Maximum Intercluster Distance
- Handling Conditional Discrimination
- Fair Clustering Through Fairlets
- Toward Privacy in Public Databases
- Primal-dual approximation algorithms for metric facility location and k-median problems
Their papers
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (2004) — 411 citations