The robust vertex centdian location problem with interval vertex weights on general graphs
نویسندگان
چکیده مقاله:
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs is solved in cubic time.
منابع مشابه
Capacitated k-Center Problem with Vertex Weights
We study the capacitated k-center problem with vertex weights. It is a generalization of the well known k-center problem. In this variant each vertex has a weight and a capacity. The assignment cost of a vertex to a center is given by the product of the weight of the vertex and its distance to the center. The distances are assumed to form a metric. Each center can only serve as many vertices as...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملPacking interval graphs with vertex-disjoint triangles
We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.
متن کاملThe Vertex Isoperimetric Problem on Kneser Graphs
For a simple graph G = (V,E), the vertex boundary of a subset A ⊆ V consists of all vertices not in A that are adjacent to some vertex in A. The goal of the vertex isoperimetric problem is to determine the minimum boundary size of all vertex subsets of a given size. In particular, define μG(r) as the minimum boundary size of all vertex subsets of G of size r. Meanwhile, the vertex set of the Kn...
متن کاملImproved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
In a recent paper [10], an algorithmic approach was presented for the robust (minmax regret) absolute deviation location problem on networks with vertex weights which are linear functions of an uncertain or dynamically changing parameter. In this paper, we present algorithmic and analytical improvements that significantly reduce the computational complexity bounds for the algorithm.
متن کاملPolynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs
Given a vertex-weighted graph G = (V,E) and a set S ⊆ V , a subset feedback vertex set X is a set of the vertices of G such that the graph induced by V \ X has no cycle containing a vertex of S. The Subset Feedback Vertex Set problem takes as input G and S and asks for the subset feedback vertex set of minimum total weight. In contrast to the classical Feedback Vertex Set problem which is obtai...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 8 شماره 3
صفحات 15- 26
تاریخ انتشار 2022-11
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی برای این مقاله ارائه نشده است
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023