[Keyword: Cactus Graphs] AND [All Categories: Probability & Statistics] : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
[Keyword: Cactus Graphs] AND [All Categories: Computer Science] (2)	15 Mar 2025	Run
[Keyword: Cactus Graphs] AND [All Categories: Probability & Statistics] (1)	15 Mar 2025	Run
[Author: Hai, le Mau] AND [Keyword: Class] AND [All Categories: Probability & S... (1)	15 Mar 2025	Run
Keyword: Bulk Gap (0)	15 Mar 2025	Run
Keyword: Locally Compact Quantum Groups (4)	15 Mar 2025	Run

articleNo Access
A modified optimal algorithm for $2$ $2$ -maxian location problems on cactus graphs
- L. Modabber,
- B. Alizadeh, and
- F. Baroughi
Asian-European Journal of Mathematics01 Mar 2017
Preview Abstract
This paper considers the $2$ $2$ -maxian location problem on a cactus graph $G = (V, E)$ $G = (V, E)$ in which the aim is to find two points on $G$ $G$ for establishing obnoxious facilities such that the sum of weighted distances from all vertices (existing clients) to the farthest facility is maximized. We develop a modified algorithm for obtaining an optimal solution of the problem under investigation. The proposed algorithm is based on the generic solution idea by Kang et al., while it is straightforward and takes lower computational operations.

1