Daniel R. Schmidt
2018
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Daniel R. Schmidt trusts
Their strongest outbound trust, strongest first, inferred from their citations.
- Teofilo F. Gonzalez (in Algorithms & Complexity)
Papers from Daniel R. Schmidt's perspective
Ordered by how strongly the researchers Daniel R. Schmidt trusts endorse each paper. Same corpus, a different order for every researcher.
- Clustering to Minimize the Maximum Intercluster Distance
- A multidisciplinary survey on discrimination analysis
- Equality of Opportunity in Supervised Learning
- Fair Clustering Through Fairlets
- Privacy preserving clustering with constraints
- Handling Conditional Discrimination
- Achieving anonymity via clustering (ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems)
- A 1.488 approximation algorithm for the uncapacitated facility location problem (Information and Computation)
- A new greedy approach for facility location problems
- Algorithms for facility location problems with outliers (ACM-SIAM Symposium on Discrete Algorithms)
Their papers
- On the cost of essentially fair clusterings (2018) — 120 citations