The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem

DOI10.1142/S0129054118500314zbMath1415.68112OpenAlexW2902932976MaRDI QIDQ5384533

Mostafa Nouri-Baygi

Publication date: 24 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118500314

zbMATH Keywords

NP-completenessapproximation algorithmsset covercomponent selectionred-blue set cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
• A component-oriented software toolkit for patient-specific finite element model generation
• Approximation algorithms for combinatorial problems
• Developing extendible component-oriented finite element software
• Approximating Component Selection with General Costs
• Analytical approach to parallel repetition

This page was built for publication: The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem