Server Placements, Roman Domination and other Dominating Set Variants

Pagourtzis, A; Penna, P; Schlude, K; Steinhöfel, K; Taylor, D; Widmayer, P

dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Penna, P	en
dc.contributor.author	Schlude, K	en
dc.contributor.author	Steinhöfel, K	en
dc.contributor.author	Taylor, D	en
dc.contributor.author	Widmayer, P	en
dc.date.accessioned	2014-03-01T02:49:11Z
dc.date.available	2014-03-01T02:49:11Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34381
dc.subject	Dominating Set	en
dc.subject	Facility Location	en
dc.subject	File Sharing	en
dc.subject	Variational Models	en
dc.title	Server Placements, Roman Domination and other Dominating Set Variants	en
heal.type	conferenceItem	en
heal.publicationDate	2002	en
heal.abstract	Dominating sets in their many variations model a wealth of optimizationproblems like facility location or distributed file sharing. Forinstance, when a request can occur at any node in a graph and requiresa server at that node, a minimumdominating set represents a minimumset of servers that serve an arbitrary single request by moving a serveralong at most one edge. This paper	en
heal.journalName	IFIP International Conference on Theoretical Computer Science	en