The following pages link to Mohit Singh (Q403669):
Displaying 50 items.
- New approaches to multi-objective optimization (Q403670) (← links)
- On an extremal problem related to a theorem of Whitney (Q869580) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
- Effect of discrete breathers on the specific heat of a nonlinear chain (Q2022603) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- Simple graph density inequalities with no sum of squares proofs (Q2221001) (← links)
- Integrality gap of the vertex cover linear programming relaxation (Q2294318) (← links)
- Minimum Birkhoff-von Neumann decomposition (Q2401174) (← links)
- Degree bounded matroids and submodular flows (Q2448960) (← links)
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (Q2843243) (← links)
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285) (← links)
- Set Covering with Our Eyes Closed (Q2848202) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Discrepancy Without Partial Colorings (Q2969622) (← links)
- (Q2999657) (← links)
- Iterative Methods in Combinatorial Optimization (Q3087101) (← links)
- k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree (Q3439087) (← links)
- Degree Bounded Matroids and Submodular Flows (Q3503852) (← links)
- Edge Coloring and Decompositions of Weighted Graphs (Q3541103) (← links)
- Survivable network design with degree or order constraints (Q3549666) (← links)
- Approximating minimum bounded degree spanning trees to within one of optimal (Q3549667) (← links)
- Survivable Network Design with Degree or Order Constraints (Q3575159) (← links)
- Approximating the <i>k</i>-multicut problem (Q3581503) (← links)
- Improving Integrality Gaps via Chvátal-Gomory Rounding (Q3588421) (← links)
- On Two-Stage Stochastic Minimum Spanning Trees (Q3596356) (← links)
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs (Q3603459) (← links)
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (Q3613758) (← links)
- Iterative Rounding for Multi-Objective Optimization Problems (Q3639238) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- (Q4608039) (← links)
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- Efficient algorithms for discrepancy minimization in convex sets (Q4684830) (← links)
- Heterogeneous Multi-resource Allocation with Subset Demand Requests (Q5057984) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design (Q5085119) (← links)
- Tropicalization of graph profiles (Q5098834) (← links)
- Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency (Q5106381) (← links)
- Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems (Q5146823) (← links)
- Proportional Volume Sampling and Approximation Algorithms for <i>A</i>-Optimal Design (Q5236268) (← links)
- Entropy, optimization and counting (Q5259538) (← links)
- On Weighted Bipartite Edge Coloring. (Q5275363) (← links)
- (Q5302101) (← links)
