The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (Q5384533): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4952637 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A component-oriented software toolkit for patient-specific finite element model generation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3651735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analytical approach to parallel repetition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Developing extendible component-oriented finite element software / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating Component Selection with General Costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems / rank | |||
Normal rank | |||
Revision as of 16:38, 19 July 2024
scientific article; zbMATH DE number 7072325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem |
scientific article; zbMATH DE number 7072325 |
Statements
The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (English)
0 references
24 June 2019
0 references
component selection
0 references
approximation algorithms
0 references
NP-completeness
0 references
set cover
0 references
red-blue set cover
0 references
0 references
