matching interdiction problem in dendrimers
Authors
abstract
the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdendrimers. then, it is shown that proportion of difference of two optimal andapproximate answers from the weight of maximum matching in these dendrimersis equal to the maximum value.
similar resources
The matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
full textMatching Interdiction
In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such that the weight of a maximum weight matching in the remaining graph is minimized. In this work we introduce the matching interdiction problem and show that it is strongly NP-complete even when the input ...
full textSymmetric Interdiction for Matching Problems
Motivated by denial-of-service network attacks, we introduce the symmetric interdiction model, where both the interdictor and the optimizer are subject to the same constraints of the underlying optimization problem. We give a general framework that relates optimization to symmetric interdiction for a broad class of optimization problems. We then study the symmetric matching interdiction problem...
full textMatrix Interdiction Problem
In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove a set of k matrix columns that minimizes in the residual matrix the sum of the row values, where the value of a row is defined to be the largest entry in that row. This combinatorial problem is closely related to bipartite network interdiction problem that can be applied to minimize th...
full textA Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the network from a designated source to a known terminus, wherein the agents may modify strategies in selected subsequent periods according to respective decision and implementation cycles. For the resulting minimax model, ...
full textOn the independent set interdiction problem
The purpose of the independent set interdiction problem in the weighted graph G is to determine a set of vertices R∗ such that the weight of the maximum independent set in G−R∗ is minimized. We define an approximate solution for this problem. Then, an upper bound for the relative error of this problem is obtained. We show that the limit of the relative error of the independent set interdiction ...
full textMy Resources
Save resource for easier access later
Journal title:
iranian journal of mathematical chemistryPublisher: university of kashan
ISSN 2228-6489
volume 6
issue 1 2015
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023