Iterative rounding and relaxation

zbMATH Open1223.90054MaRDI QIDQ2999657FDOQ2999657

Authors Lap Chi Lau, Mohit Singh 

Publication date 16 May 2011

zbMATH Keywords

degree bounded matroid problemJain's methodminimum bounded degree

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Iterative methods in combinatorial optimization
• Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
• A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
• Prize-collecting Steiner networks via iterative rounding

Cited In (8)

• Iterated snap rounding
• Title not available (Why is no real title available?)
• Iterative methods in combinatorial optimization
• A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
• Computing and Combinatorics
• An iterative method for improving decimal calculations on computers
• Computing predecessor and successor in rounding to nearest
• New developments in iterated rounding (invited talk)

This page was built for publication: Iterative rounding and relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999657)