Rounding to an integral program (Q943791)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rounding to an integral program	scientific article

Statements

scholarly article

0 references

Rounding to an integral program (English)

0 references

0 references

0 references

Operations Research Letters

0 references

publication date

10 September 2008

0 references

zbMATH Keywords

LP-rounding

0 references

integer covering

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.orl.2007.11.002

0 references

Set Partitioning: A survey

0 references

A linear-time approximation algorithm for the weighted vertex cover problem

0 references

On dependent randomized rounding algorithms

0 references

On the hardness of approximating minimum vertex cover

0 references

A threshold of ln <i>n</i> for approximating set cover

0 references

The Set-Partitioning Problem: Set Covering with Equality Constraints

0 references

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

0 references

Algorithms and Data Structures

0 references

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

0 references

Approximation Algorithms for the Set Covering and Vertex Cover Problems

0 references

0 references

Approximation algorithms for combinatorial problems

0 references

On the multi-radius cover problem

0 references

Optimal Capacity Scheduling—I

0 references

Approximation algorithms for feasible cut and multicut problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.orl.2007.11.002

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:943791

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q943791&oldid=35071797"