scientific article; zbMATH DE number 871894

zbMATH Open0845.90092MaRDI QIDQ4875163FDOQ4875163

Aravind Srinivasan

Publication date: 16 September 1996

Title of this publication is not available (Why is that?)

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
• [[:Publication:4252343|Title not available (Why is that?)]]

zbMATH Keywords

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (10)

• Approximating covering integer programs with multiplicity constraints
• Geometric rounding: A dependent randomized rounding scheme
• Title not available (Why is that?)
• Local ratio method on partial set multi-cover
• Approximation algorithms for covering/packing integer programs
• An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
• Approximation algorithm for partial positive influence problem in social network
• Improved parallel approximation of a class of integer programming problems

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)