English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the present paper, we propose an efficient local search for the minimumindependent dominating set problem. We consider a local search that uses$k$-swap as the neighborhood operation. Given a feasible solution $S$, it isthe operation of obtaining another feasible solution by dropping exactly $k$vertices from $S$ and then by adding any number of vertices to it. We showthat, when $k=2$, (resp., $k=3$ and a given solution is minimal with respect to2-swap), we can find an improved solution in the neighborhood or conclude thatno such solution exists in $O(n\Delta)$ (resp., $O(n\Delta^3)$) time, where $n$denotes the number of vertices and $\Delta$ denotes the maximum degree. Wedevelop a metaheuristic algorithm that repeats the proposed local search andthe plateau search iteratively, where the plateau search examines solutions ofthe same size as the current solution that are obtainable by exchanging asolution vertex and a non-solution vertex. The algorithm is so effective that,among 80 DIMACS graphs, it updates the best-known solution size for five graphsand performs as well as existing methods for the remaining graphs.

An Efficient Local Search for the Minimum Independent Dominating Set Problem