Computing minimum k-connected m-fold dominating set in general graphs

Zhao Zhang, Jiao Zhou, Shaojie Tang, Xiaohui Huang, Ding-Zhu Du

Year of publication:	2018
Authors:	Zhang, Zhao ; Zhou, Jiao ; Tang, Shaojie ; Huang, Xiaohui ; Du, Dingzhu
Published in:	INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 2, p. 217-224
Subject:	wireless sensor network \| connected dominating set \| fault tolerance \| approximation algorithm \| Graphentheorie \| Graph theory \| Algorithmus \| Algorithm \| Computernetz \| Computer network \| Mobile Anwendung \| Mobile application

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10011878225

A service of the