scientific article; zbMATH DE number 871894

MaRDI QIDQ4875163zbMATH OpenFDO

Authors Aravind Srinivasan

Publication date 16 September 1996

zbMATH Keywords

minimaxcoveringpackingVLSI routingexistence of rare eventsNP-hard integer programsrandomized rounding of linear relaxations

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
• A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
• New algorithmic aspects of the local lemma with applications to routing and partitioning
• scientific article; zbMATH DE number 1305457

Cited in

(11)

• An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
• Local ratio method on partial set multi-cover
• Geometric rounding: A dependent randomized rounding scheme
• Improved parallel approximation of a class of integer programming problems
• Approximation algorithms for covering/packing integer programs
• Congestion minimization for multipath routing via multiroute flows
• Approximating covering integer programs with multiplicity constraints
• Approximation algorithm for partial positive influence problem in social network
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
• Using Lovász local lemma in the space of random injections

This page was built for publication:

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