Search Results - Anand, Louis

Refine Results
  1. 1
    Spectral Properties of Hypergraph Laplacian and Approximation Algorithms

    Spectral Properties of Hypergraph Laplacian and Approximation Algorithms by Chan, T.-H. Hubert, Louis, Anand, Tang, Zhihao Gavin, Zhang, Chenzi

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    The Complexity of Approximating Vertex Expansion

    The Complexity of Approximating Vertex Expansion by Louis, Anand, Raghavendra, Prasad, Vempala, Santosh

    Request full text
    Items that cite this one
    Conference Proceeding
    Save to List
    Saved in:
  3. 3
    A 3-approximation algorithm for the facility location problem with uniform capacities

    A 3-approximation algorithm for the facility location problem with uniform capacities by Aggarwal, Ankit, Louis, Anand, Bansal, Manisha, Garg, Naveen, Gupta, Neelima, Gupta, Shubham, Jain, Surabhi

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    On Sparsest Cut and Conductance in Directed Polymatroidal Networks

    On Sparsest Cut and Conductance in Directed Polymatroidal Networks by Chekuri, Chandra, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    New Approximation Bounds for Small-Set Vertex Expansion

    New Approximation Bounds for Small-Set Vertex Expansion by Ghoshal, Suprovat, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Improved Algorithm for Degree Bounded Survivable Network Design Problem

    Improved Algorithm for Degree Bounded Survivable Network Design Problem by Anand, Louis, Vishnoi, Nisheeth

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Approximating CSPs with Outliers

    Approximating CSPs with Outliers by Ghoshal, Suprovat, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Many Sparse Cuts via Higher Eigenvalues

    Many Sparse Cuts via Higher Eigenvalues by Anand, Louis, Prasad Raghavendra, Tetali, Prasad, Vempala, Santosh

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Improved linearly ordered colorings of hypergraphs via SDP rounding

    Improved linearly ordered colorings of hypergraphs via SDP rounding by Anand, Louis, Newman, Alantha, Ray, Arka

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All

    Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All by Panda, Atasi, Anand, Louis, Nimbhorkar, Prajakta

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Planted Models for the Densest \(k\)-Subgraph Problem

    Planted Models for the Densest \(k\)-Subgraph Problem by Khanna, Yash, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Accelerated Newton Iteration for Roots of Black Box Polynomials

    Accelerated Newton Iteration for Roots of Black Box Polynomials by Louis, Anand, Vempala, Santosh S.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  13. 13
    Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes

    Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes by Anand, Louis, Rameesh, Paul, Ray, Arka

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Approximation Algorithms and Hardness for Strong Unique Games

    Approximation Algorithms and Hardness for Strong Unique Games by Ghoshal, Suprovat, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Sampling Ex-Post Group-Fair Rankings

    Sampling Ex-Post Group-Fair Rankings by Gorantla, Sruthi, Deshpande, Amit, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Planted Models for \(k\)-way Edge and Vertex Expansion

    Planted Models for \(k\)-way Edge and Vertex Expansion by Anand, Louis, Venkat, Rakesh

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs

    Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs by Kumar, Akash, Anand, Louis, Rameesh, Paul

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness

    Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness by Gorantla, Sruthi, Bhansali, Eshaan, Deshpande, Amit, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints

    Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints by Anand, Louis, Nasre, Meghana, Nimbhorkar, Prajakta, Sankar, Govind S

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Sampling Individually-Fair Rankings that are Always Group Fair

    Sampling Individually-Fair Rankings that are Always Group Fair by Gorantla, Sruthi, Mehrotra, Anay, Deshpande, Amit, Anand, Louis

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: