
handle: 11583/2500169 , 11583/2500161 , 11573/421056 , 11573/535381
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory, maximum \(k\)-coverage, Negative results, 511, competitive ratio, [INFO] Computer Science [cs], Maximum k coverage, competitive ratio; graphs; maximum k-coverage; negative results, 004, Competitive ratio, Principes généraux des mathématiques, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Maximum k-coverage, negative results, Graphs, approximation algorithms; algorithms; parallel repetition
Extremal problems in graph theory, maximum \(k\)-coverage, Negative results, 511, competitive ratio, [INFO] Computer Science [cs], Maximum k coverage, competitive ratio; graphs; maximum k-coverage; negative results, 004, Competitive ratio, Principes généraux des mathématiques, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Maximum k-coverage, negative results, Graphs, approximation algorithms; algorithms; parallel repetition
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 29 | |
| 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. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
