Research map / Learning theory and algorithms / Combinatorial and search optimization
Faster width-dependent algorithm for mixed packing and covering LPs
Digvijay Boob, Saurabh Sawlani, Di Wang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use an area-convex regularizer tailored to the constraint matrices instead of a strongly convex regularizer | Mixed packing-covering LP algorithms · Mixed packing-covering LPs | parallel runtime: \widetilde{O}(w \sqrt{n} \varepsilon^{-1}) -> \widetilde{O}(w \varepsilon^{-1}) | Improved |
| Use a width-dependent algorithm rather than a width-independent algorithm | Mixed packing-covering LP algorithms · Mixed packing-covering LPs | total work: \widetilde{O}(N \varepsilon^{-2}) -> \widetilde{O}( w N \varepsilon^{-1}) | Improved |
| Apply the MPC algorithm to the densest-subgraph LP, whose width is the maximum graph degree | Densest subgraph · Densest subgraph | parallel runtime: \widetilde{O}(\Delta \varepsilon^{-1}) | Improved |
Closest papers by meaning
- A Dynamic Algorithm for Weighted Submodular Cover Problem (ICML 2024 · similarity 0.85)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.85)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.85)
- Improved Approximations for Hard Graph Problems using Predictions (ICML 2025 · similarity 0.84)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.84)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
