Filters








7,610 Hits in 5.4 sec

Blocking Adversarial Influence in Social Networks [article]

Feiran Jia, Kai Zhou, Charles Kamhoua, Yevgeniy Vorobeychik
2020 arXiv   pre-print
Our approach is to approximate the attacker's problem as the maximum node domination problem.  ...  We investigate the problem of limiting the diffusion of negative information by blocking nodes and edges in the network.  ...  We compare the optimal objective values of BR-MILP and BR-LP, denoted as M LP and M M ILP , respectively. We are interested in the integrality gap defined as IG = M LP /M M ILP . Table 1  ... 
arXiv:2011.01346v1 fatcat:veqyct366zcu5m723vyhsd6mly

On defensive alliances and strong global offensive alliances

Mitre C. Dourado, Luerbio Faria, Miguel A. Pizaña, Dieter Rautenbach, Jayme L. Szwarcfiter
2014 Discrete Applied Mathematics  
We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs.  ...  Furthermore, we prove that determining the strong global offensive alliance number γ ô(G) of a graph G is APX-hard for cubic graphs and NP-hard for chordal graphs.  ...  Since |A| − |D| = 2m(G) in both cases, the desired result follows. 2 Theorem 5 There is some > 0 such that approximating Minimum Strong Global Offensive Alliance within a factor (1 + ) is NP-hard for cubic  ... 
doi:10.1016/j.dam.2013.06.029 fatcat:iwrga2axcnbofo4czozrigkgpu

Server Placements, Roman Domination and Other Dominating Set Variants [chapter]

Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
For planar graphs, we propose a PTAS for Roman domination (and show that nothing better exists), and we get a constant approximation for win-win.  ...  For instance, when a request can occur at any node in a graph and requires a server at that node, a minimum dominating set represents a minimum set of servers that serve an arbitrary single request by  ...  for the defense.  ... 
doi:10.1007/978-0-387-35608-2_24 dblp:conf/ifipTCS/PagourtzisPSSTW02 fatcat:5j2g2o2p3babzks5umqmrwfe3e

Alliances and related parameters in graphs [article]

Henning Fernau, Juan A. Rodriguez-Velazquez
2013 arXiv   pre-print
for the study of alliances and domination.  ...  Finally, we also give a survey on the mentioned graph parameters, indicating how results transfer due to our observations.  ...  For this graph parameter, mostly (in)approximability results have been derived.  ... 
arXiv:1311.4899v1 fatcat:nvwewcrfizc5nojyietet6jum4

A survey on alliances and related parameters in graphs
English

Henning Fernau, Juan A. Rodrıguez-Velazquez
2014 Electronic Journal of Graph Theory and Applications  
for the study of alliances and domination.  ...  Seeing these connections should be helpful for researchers both in domination and in alliance theory.  ...  For this graph parameter, mostly (in)approximability results have been derived.  ... 
doi:10.5614/ejgta.2014.2.1.7 fatcat:um6dgoir7fhp3ehk6fm3dmtbg4

Multi-objective software assignment for active cyber defense

Chu Huang, Sencun Zhu, Quanlong Guan
2015 2015 IEEE Conference on Communications and Network Security (CNS)  
Software diversity is a well-accepted security principle for active cyber defense against the spread of Internet worms and other malicious attacks.  ...  The results show that our model can be applied as an effective method for assigning software for multiple objectives.  ...  The results show that this algorithm solves the multi-objective software assignment problem by providing a set of non-dominated solutions meeting different needs and preferences in practice.  ... 
doi:10.1109/cns.2015.7346840 dblp:conf/cns/HuangZG15 fatcat:3cd6gvhq3nhjzjmb3bnarbvol4

Multi-resource defensive strategies for patrolling games with alarm systems [article]

Nicola Basilico, Giuseppe De Nittis, Nicola Gatti
2016 arXiv   pre-print
The literature provides results for the basic single-resource case, showing that even in that case the problem is computationally hard.  ...  For each considered problem, we provide a computational analysis and propose algorithmic methods.  ...  Approximating it with additive gap is, in general, hard.  ... 
arXiv:1606.02221v1 fatcat:iecev4w2zvei5hp3cmwwyi5jpu

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm [chapter]

Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger
2009 Lecture Notes in Computer Science  
This problem is NP-hard [11] and the best previous practical solution is a 38-approximation algorithm by Carmi et al. [4].  ...  Combining our line-separable algorithm with techniques from the algorithm of Carmi et al. [4] results in an O(m 2 n 4 ) time 22-approximate solution to the discrete unit disk cover problem.  ...  Acknowledgements The authors wish to thank Paz Carmi for sharing his insights and discussing details of his results on the discrete unit disk cover problem [4] .  ... 
doi:10.1007/978-3-642-10631-6_7 fatcat:4wsxkcgi4bf77bho5x6aoqrnzi

Minimum edge blocker dominating set problem

Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao
2015 European Journal of Operational Research  
Dominating sets are used in a wide variety of graph-based applications such as the analysis of wireless and social networks. We show that the decision version of EBDP is NP-hard for any fixed r > 0.  ...  Given a vertex-weighted undirected graph and r > 0, remove a minimum number of edges so that the weight of any dominating set in the remaining graph is at least r.  ...  Acknowledgements This research was supported in part by the Air Force Research Laboratory (AFRL) and the Defense Threat Reduction Agency (DTRA).  ... 
doi:10.1016/j.ejor.2015.05.037 fatcat:xjlllfp4tvampgrcayh6kgshaa

K-Core Minimization: A Game Theoretic Approach [article]

Sourav Medya, Tiyani Ma, Arlei Silva, Ambuj Singh
2020 arXiv   pre-print
As computing Shapley values is also NP-hard, we efficiently approximate them using a randomized algorithm with probabilistic guarantees.  ...  Our experiments, using several real datasets, show that the proposed algorithm outperforms competing solutions in terms of k-core minimization while being able to handle large graphs.  ...  ACKNOWLEDGMENT The authors would like to thank Neeraj Kumar for helpful discussions.  ... 
arXiv:1901.02166v2 fatcat:zsk46cwpnnawnipe7uyzulqmsy

Compact Flow Diagrams for State Sequences

Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben
2017 ACM Journal of Experimental Algorithmics  
We evaluate the performance of our algorithms on a football data set and generated data.  ...  We argue about the usefulness of the flow diagram by applying the algorithms to two problems in sports analysis.  ...  Set Cover is well known to be NP-hard, and also hard to approximate: Lemma 9 (Lund and Yannakakis [15] ).  ... 
doi:10.1145/3150525 fatcat:5fzuzitlnjhsjmesenymyyg6am

Approximation Algorithms for the Class Cover Problem

Adam H. Cannon, Lenore J. Cowen
2004 Annals of Mathematics and Artificial Intelligence  
We then present a polynomial-time approximation algorithm for class cover that performs within a lnn + 1 factor of optimal, which is nearly tight under standard hardness assumptions.  ...  We prove similar hardness results to disk cover.  ...  Acknowledgments We thank Samir Kuller for his early encouragement and enthusiasm for the problem formulation, and Carey Priebe for interesting discussions.  ... 
doi:10.1023/b:amai.0000012867.03976.a5 fatcat:gzyt6svoyffzra63nuor6wtb6y

BERT-PLI: Modeling Paragraph-Level Interactions for Legal Case Retrieval

Yunqiu Shao, Jiaxin Mao, Yiqun Liu, Weizhi Ma, Ken Satoh, Min Zhang, Shaoping Ma
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We conduct extensive experiments on the benchmark of the relevant case retrieval task in COLIEE 2019. Experimental results demonstrate that our proposed method outperforms existing solutions.  ...  Besides that, the definition of relevance between a query case and a supporting case is beyond general topical relevance and it is therefore difficult to construct a large-scale case retrieval dataset,  ...  Acknowledgements Research was funded partially by NSF IIS #1817046 and DTRA HDTRA1-19-1-0017.  ... 
doi:10.24963/ijcai.2020/480 dblp:conf/ijcai/MedyaMSS20 fatcat:kzupumnfvfflzjwgpjrbijtm4a

Defending against Contagious Attacks on a Network with Resource Reallocation [article]

Rufan Bai, Haoxing Lin, Xinyu Yang, Xiaowei Wu, Minming Li, Weijia Jia
2020 arXiv   pre-print
For positive results, we give a mixed integer linear program formulation for the problem and a bi-criteria approximation algorithm.  ...  Our experimental results demonstrate that the allocation and reallocation strategies our algorithm computes perform well in terms of minimizing the damage due to contagious attacks.  ...  The results are shown in Table 2 , where BA( ) stands for the approximation algorithm by rounding the optimal solution for LP( · R) and optimizing ∈ (0, 1); BA( , τ ) stands for the approximation algorithm  ... 
arXiv:2012.01036v2 fatcat:u3zwwdx5nbgndkcdo6q47rc5p4

A Branch-Decomposition Approach to Power Network Design [article]

Kin Cheong Sou
2016 arXiv   pre-print
A planarization technique is explored for problem instances with nonplanar graphs.  ...  Contrary to standard integer programming and heuristic/evolutionary approaches for power network design, the proposed approach is exact and requires only polynomial computation time if the graph is planar  ...  Qianping Gu for the fruitful communications regarding branch-decomposition.  ... 
arXiv:1511.08927v2 fatcat:fmqx4kw6x5af7k7mqcsgm7mx6u
« Previous Showing results 1 — 15 out of 7,610 results