Experimental and Efficient Algorithms

DOI10.1007/B136461zbMATH Open1121.68345OpenAlexW2485841483MaRDI QIDQ5710071FDOQ5710071

Authors: Refael Hassin, Danny Segev 

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136461

Recommendations

• Rounding to an integral program
• Rounding algorithms for covering problems
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• scientific article; zbMATH DE number 1263202
• scientific article; zbMATH DE number 1182765

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cited In (4)

• Rounding to an integral program
• On the parameterized complexity of multiple-interval graph problems
• Improved Approximation Guarantees for Packing and Covering Integer Programs
• On the multi-radius cover problem

This page was built for publication: Experimental and Efficient Algorithms

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