AI Paper Atlas

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

NeurIPS 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 2 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use an area-convex regularizer tailored to the constraint matrices instead of a strongly convex regularizerMixed packing-covering LP algorithms · Mixed packing-covering LPsparallel runtime: \widetilde{O}(w \sqrt{n} \varepsilon^{-1}) -> \widetilde{O}(w \varepsilon^{-1})Improved
Use a width-dependent algorithm rather than a width-independent algorithmMixed packing-covering LP algorithms · Mixed packing-covering LPstotal 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 degreeDensest subgraph · Densest subgraphparallel runtime: \widetilde{O}(\Delta \varepsilon^{-1})Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy