
handle: 1871/41753 , 11858/00-001M-0000-0014-BC99-E
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization, hardness of approximation, Analysis of algorithms and problem complexity, Complexity, Approximation algorithms, Theoretical Computer Science, SDG 17 - Partnerships for the Goals, Interval graphs, NP-hardness, pricing, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), interval graphs, complexity, approximation algorithms, Hardness of approximation, Pricing, Computer Science(all)
Combinatorial optimization, hardness of approximation, Analysis of algorithms and problem complexity, Complexity, Approximation algorithms, Theoretical Computer Science, SDG 17 - Partnerships for the Goals, Interval graphs, NP-hardness, pricing, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), interval graphs, complexity, approximation algorithms, Hardness of approximation, Pricing, Computer Science(all)
| citations The total number of citations received by all articles of the researcher of interest. | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
