Partial Resampling to Approximate Covering Integer Programs (Q4575724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / title
 
Partial resampling to approximate covering integer programs† (English)
Property / title: Partial resampling to approximate covering integer programs† (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1522.68754 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/rsa.20964 / rank
 
Normal rank
Property / published in
 
Property / published in: Random Structures & Algorithms / rank
 
Normal rank
Property / publication date
 
11 October 2023
Timestamp+2023-10-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 October 2023 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7748477 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
randomized rounding
Property / zbMATH Keywords: randomized rounding / rank
 
Normal rank
Property / zbMATH Keywords
 
set cover
Property / zbMATH Keywords: set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating (Sparse) Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Greedy Heuristic for Continuous Covering and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsidependency in the Moser-Tardos Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Moser--Tardos Framework with Partial Resampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the discrepancy of matrices with bounded row and column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for covering/packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Analysis of the Greedy Algorithm for Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Lovász Local Lemma, and its Applications to Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598189 / rank
 
Normal rank

Latest revision as of 04:25, 3 August 2024

scientific article; zbMATH DE number 6904016
Language Label Description Also known as
English
Partial Resampling to Approximate Covering Integer Programs
scientific article; zbMATH DE number 6904016

    Statements

    Partial Resampling to Approximate Covering Integer Programs (English)
    0 references
    Partial resampling to approximate covering integer programs† (English)
    0 references
    0 references
    0 references
    0 references
    16 July 2018
    0 references
    11 October 2023
    0 references
    approximation algorithms
    0 references
    integer programming
    0 references
    randomized rounding
    0 references
    set cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references