Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
type: Item
instance of: scholarly article
title: Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
zbMATH Open document ID: 1338.05263
author: Eh. Kh. Gimadi
published in: Applied Mathematics and Computation
publication date: 2016-06-22T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6596618
zbMATH Keywords: approximation algorithms
zbMATH Keywords: Euclidean \( m\)-PSP
zbMATH Keywords: metric \( m\)-weighted clique problem
zbMATH Keywords: \( m\)-layer planar assignment problem
zbMATH Keywords: performance guarantees
zbMATH Keywords: asymptotic optimality
MaRDI profile type: Publication
full work available at URL: j.amc.2014.11.037
OpenAlex ID: W1989997226
cites work: On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
cites work: Assignment Problems
cites work: Well-solved cases of the 2-peripatetic salesman problem
cites work: Lower bounds for symmetricK-peripatetic salesman problems
cites work: Bounds for the symmetric 2-peripatetic salesman problem
cites work: A branch and bound algorithm for symmetric 2-peripatetic salesman problems
cites work: Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
cites work: 2-approximation algorithm for finding a clique with minimum weight of vertices and edges
cites work: Arrays of distinct representatives --- a very simple NP-complete problem
cites work: Complexity of a 3-dimensional assignment problem
cites work: Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
cites work: Q3416558
cites work: Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: A strongly polynomial algorithm for the transportation problem
cites work: Q4068472
cites work: Q3291034
cites work: Q4327561
cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
cites work: Q4801573
cites work: The traveling salesman problem and its variations
DOI: 10.1016/J.AMC.2014.11.037
Recommended article: Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
Recommended article: Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
Recommended article: Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
Recommended article: Q3150852
Recommended article: Q4875193
Recommended article: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
Recommended article: Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs
Recommended article: Q3680859
Recommended article: Efficient algorithms for finding critical subgraphs
Recommended article: An efficiently solvable case of the minimum weight equivalent subgraph problem
description: scientific article; zbMATH DE number 6596618