Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.04.005 / rank
Normal rank
 
Property / author
 
Property / author: Da-Chuan Xu / rank
Normal rank
 
Property / author
 
Property / author: Dong-lei Du / rank
Normal rank
 
Property / author
 
Property / author: Chen-Chen Wu / rank
Normal rank
 
Property / author
 
Property / author: Da-Chuan Xu / rank
 
Normal rank
Property / author
 
Property / author: Dong-lei Du / rank
 
Normal rank
Property / author
 
Property / author: Chen-Chen Wu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6576261 / rank
 
Normal rank
Property / zbMATH Keywords
 
penalty
Property / zbMATH Keywords: penalty / rank
 
Normal rank
Property / zbMATH Keywords
 
submodular vertex cover
Property / zbMATH Keywords: submodular vertex cover / rank
 
Normal rank
Property / zbMATH Keywords
 
primal-dual approximation algorithm
Property / zbMATH Keywords: primal-dual approximation algorithm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2338410001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the facility location problem with submodular penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A push-relabel framework for submodular function minimization and applications to parametric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated vertex covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better approximation ratio for the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.04.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:16, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
scientific article

    Statements

    Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 2016
    0 references
    penalty
    0 references
    submodular vertex cover
    0 references
    primal-dual approximation algorithm
    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