No label defined (Q5091035)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7561397

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561397

Statements

scholarly article

0 references

0 references

0 references

publication date

21 July 2022

0 references

zbMATH Keywords

vertex cover

0 references

multiple cover constraints

0 references

approximation algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

Using Homogeneous Weights for Approximating the Partial Cover Problem

0 references

Approximation algorithms for the partition vertex cover problem

0 references

Covering Problems with Hard Capacities

0 references

On approximation of the submodular set cover problem

0 references

Approximation algorithms for partial covering problems

0 references

0 references

Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

Applications of approximation algorithms to cooperative games

0 references

An analysis of the greedy algorithm for the submodular set covering problem

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.ISAAC.2018.43

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091035

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