The computational complexity of and approximation algorithms for variants of the component selection problem

DOI10.1142/S0129054118500314zbMATH Open1415.68112OpenAlexW2902932976MaRDI QIDQ5384533FDOQ5384533

Authors: 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

Recommendations

• Approximating Component Selection with General Costs
• Optimal Component Selection for Component-Based Systems
• Constraint optimization-based component selection problem
• scientific article; zbMATH DE number 2084444
• Integrated model for software component selection with simultaneous consideration of implementation and verification

zbMATH Keywords

approximation algorithmsNP-completenessset covercomponent selectionred-blue set cover

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Approximating Component Selection with General Costs
• Heuristics for automated knowledge source integration and service composition
• Constraint optimization-based component selection problem

This page was built for publication: The computational complexity of and approximation algorithms for variants of the component selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384533)