ロード中...
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
We consider the Budgeted version of the classical Connected Dominating Set problem (BCDS). Given a graph G and a budget k, we seek a connected subset of at most k vertices maximizing the number of dominated vertices in G. We improve over the previous [Formula: see text] approximation in [Khuller, Pu...
保存先:
| 出版年: | Combinatorial Algorithms |
|---|---|
| 主要な著者: | , , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
2020
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7254917/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48966-3_28 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|