<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>preprint</genre>

<titleInfo><title>Online Connected Dominating Set Leasing</title></titleInfo>





<name type="personal">
  <namePart type="given">Christine</namePart>
  <namePart type="family">Markarian</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">63</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">We introduce the \emph{Online Connected Dominating Set Leasing} problem
(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set
$\mathcal{L}$ of lease types each characterized by a duration and cost, and a
sequence of subsets of $V$ arriving over time. A node can be leased using lease
type $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives
in each step $t$ a subset of nodes that need to be dominated by a connected
subgraph consisting of nodes active at time $t$. The goal is to minimize the
total leasing costs. OCDSL contains the \emph{Parking Permit
Problem}~\cite{PPP} as a special subcase and generalizes the classical offline
\emph{Connected Dominating Set} problem~\cite{Guha1998}. It has an $\Omega(\log
^2 n + \log |\mathcal{L}|)$ randomized lower bound resulting from lower bounds
for the \emph{Parking Permit Problem} and the \emph{Online Set Cover}
problem~\cite{Alon:2003:OSC:780542.780558,Korman}, where $|\mathcal{L}|$ is the
number of available lease types and $n$ is the number of nodes in the input
graph. We give a randomized $\mathcal{O}(\log ^2 n + \log |\mathcal{L}| \log
n)$-competitive algorithm for OCDSL. We also give a deterministic algorithm for
a variant of OCDSL in which the dominating subgraph need not be connected, the
\emph{Online Dominating Set Leasing} problem. The latter is based on a simple
primal-dual approach and has an $\mathcal{O}(|\mathcal{L}| \cdot
\Delta)$-competitive ratio, where $\Delta$ is the maximum degree of the input
graph.</abstract>

<originInfo><dateIssued encoding="w3cdtf">2018</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>arXiv:1805.02994</title></titleInfo>
<part>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ieee>C. Markarian, “Online Connected Dominating Set Leasing,” &lt;i&gt;arXiv:1805.02994&lt;/i&gt;. 2018.</ieee>
<chicago>Markarian, Christine. “Online Connected Dominating Set Leasing.” &lt;i&gt;ArXiv:1805.02994&lt;/i&gt;, 2018.</chicago>
<ama>Markarian C. Online Connected Dominating Set Leasing. &lt;i&gt;arXiv:180502994&lt;/i&gt;. 2018.</ama>
<apa>Markarian, C. (2018). Online Connected Dominating Set Leasing. &lt;i&gt;ArXiv:1805.02994&lt;/i&gt;.</apa>
<mla>Markarian, Christine. “Online Connected Dominating Set Leasing.” &lt;i&gt;ArXiv:1805.02994&lt;/i&gt;, 2018.</mla>
<bibtex>@article{Markarian_2018, title={Online Connected Dominating Set Leasing}, journal={arXiv:1805.02994}, author={Markarian, Christine}, year={2018} }</bibtex>
<short>C. Markarian, ArXiv:1805.02994 (2018).</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>19978</recordIdentifier><recordCreationDate encoding="w3cdtf">2020-10-12T12:42:54Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-01-06T06:54:17Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
