
Liar's Domination in Unit Disk Graphs
In this article, we study a variant of the minimum dominating set proble...
read it

Network design for st effective resistance
We consider a new problem of designing a network with small st effectiv...
read it

Shortest Reconfiguration of Matchings
Imagine that unlabelled tokens are placed on the edges of a graph, such ...
read it

When Can Liquid Democracy Unveil the Truth?
In this paper, we investigate the socalled ODPproblem that has been fo...
read it

How to Secure Matchings Against Edge Failures
The matching preclusion number of a graph is the minimal number of edges...
read it

Network Coding Algorithms for MultiLayered Video Broadcast
In this paper we give network coding algorithms for multilayered video ...
read it

Better Global Polynomial Approximation for Image Rectification
When using images to locate objects, there is the problem of correcting ...
read it
Consensus under Network Interruption and Effective Resistance Interdiction
We study the problem of network robustness under consensus dynamics. We first show that the consensus interdiction problem (CIP), in which the goal is to maximize the convergence time of consensus dynamics subject to removing limited network edges, can be cast as an effective resistance interdiction problem (ERIP). We then show that ERIP is strongly NPhard, even for bipartite graphs of diameter three with fixed source/sink edges. We establish the same hardness result for the CIP, hence correcting some claims in the existing literature. We then show that both ERIP and CIP do not admit a polynomialtime approximation scheme, and moreover, they cannot be approximated up to a (nearly) polynomial factor assuming exponential time hypothesis. Finally, using a quadratic program formulation, we devise a polynomialtime n^4approximation algorithm for ERIP that only depends on the number of nodes n and is independent of the size of edge resistances. We also develop an iterative heuristic approximation algorithm to find a local optimum for the CIP.
READ FULL TEXT
Comments
There are no comments yet.