On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Juraj Hromkovič / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / 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: 68R10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6039170 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
topic-connected overlay | |||
Property / zbMATH Keywords: topic-connected overlay / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithm | |||
Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
APX | |||
Property / zbMATH Keywords: APX / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hardness | |||
Property / zbMATH Keywords: hardness / rank | |||
Normal rank |
Revision as of 21:12, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the approximability and hardness of minimum topic connected overlay and its special instances |
scientific article |
Statements
On the approximability and hardness of minimum topic connected overlay and its special instances (English)
0 references
30 May 2012
0 references
topic-connected overlay
0 references
approximation algorithm
0 references
APX
0 references
hardness
0 references