Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph

Edward Kh. Gimadi

Applied Mathematics and Computation, 2015, vol. 255, issue C, 84-91

Abstract: Some hard-to solve combinatorial problems of finding several disjoint discrete structures in complete weighted graph are considered. Efficient algorithms with performance guarantees are constructed for the Euclidean m-Peripatetic Salesman Problem, m-Weighted Clique Problem and m-Layer Planar three-index Assignment Problem.

Keywords: Approximation algorithms; Euclidean m-PSP; Metric m-Weighted Clique Problem; m-layer Planar Assignment Problem; Performance guarantees; Asymptotic optimality (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314015604
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:255:y:2015:i:c:p:84-91

DOI: 10.1016/j.amc.2014.11.037

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().