E. Kh. Gimadi

From MaRDI portal
Person:294359

Available identifiers

zbMath Open gimadi.edward-khMaRDI QIDQ294359

List of research outcomes

PublicationDate of PublicationType
On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter2023-11-03Paper
A given diameter MST on a random graph2023-01-25Paper
On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights2022-03-22Paper
On PTAS for the geometric maximum connected \(k\)-factor problem2021-09-14Paper
On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines2021-08-03Paper
On some implementations of solving the resource constrained project scheduling problems2021-05-05Paper
On asymptotically optimal solvability of max \(m\)-\(k\)-cycles cover problem in a normed space2021-04-19Paper
An optimal algorithm for an outerplanar facility location problem with improved time complexity2019-06-24Paper
An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution2018-04-06Paper
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs2018-02-13Paper
Efficient Randomized Algorithm for a Vector Subset Problem2018-02-13Paper
Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles2017-06-08Paper
A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum2016-08-12Paper
Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below2016-08-12Paper
https://portal.mardi4nfdi.de/entity/Q57413652016-07-22Paper
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph2016-06-22Paper
On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight2016-06-16Paper
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph2015-09-30Paper
Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above2015-08-20Paper
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph2015-08-20Paper
Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations2015-07-27Paper
Approximation algorithms for the maximum 2-peripatetic salesman problem2015-07-17Paper
An effective algorithm for the two-stage location problem on a tree-like network2015-07-17Paper
On the m-capacitated peripatetic salesman problem with capacity restrictions2015-07-17Paper
Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route2015-03-13Paper
2-approximation algorithm for finding a clique with minimum weight of vertices and edges2014-12-17Paper
Uniform capacitated facility location problem with random input data2013-04-24Paper
https://portal.mardi4nfdi.de/entity/Q28989832012-07-13Paper
https://portal.mardi4nfdi.de/entity/Q28989892012-07-13Paper
https://portal.mardi4nfdi.de/entity/Q31151902012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152182012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152632012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31155912012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31155952012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156112012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156192012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156572012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156682012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156762012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156962012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157102012-02-10Paper
On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space2011-11-02Paper
https://portal.mardi4nfdi.de/entity/Q29989542011-05-11Paper
https://portal.mardi4nfdi.de/entity/Q29989762011-05-11Paper
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight2011-04-07Paper
Approximation Polynomial Algorithms for Some Modifications of TSP2011-04-07Paper
Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space2009-10-23Paper
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 22009-06-24Paper
https://portal.mardi4nfdi.de/entity/Q36190832009-04-03Paper
https://portal.mardi4nfdi.de/entity/Q53017392009-01-20Paper
On the connectedness property of service areas for the Network Facility Location Problem2007-05-29Paper
Multi-index axial assignment problem on single-cyclic permutations2007-05-29Paper
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors2007-05-29Paper
Asymptotically optimal approach for solving some hard discrete optimization problems2007-05-29Paper
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 22007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34165582007-01-22Paper
https://portal.mardi4nfdi.de/entity/Q46670992005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q48174632004-09-23Paper
https://portal.mardi4nfdi.de/entity/Q48120452004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q44619142004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44293552003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q27123012003-01-30Paper
https://portal.mardi4nfdi.de/entity/Q47880732003-01-19Paper
https://portal.mardi4nfdi.de/entity/Q47880872003-01-19Paper
Resolvability of multi-index axial assignment problem on one-cyclic substitutions2002-08-06Paper
Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis2001-03-07Paper
https://portal.mardi4nfdi.de/entity/Q45273152001-02-04Paper
https://portal.mardi4nfdi.de/entity/Q47898542001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45172742000-11-21Paper
The problem of strip packing: An asymptotically exact approach1999-10-05Paper
Bin packing: Asymptotically exact approach1999-09-15Paper
https://portal.mardi4nfdi.de/entity/Q42333371999-07-05Paper
https://portal.mardi4nfdi.de/entity/Q42425641999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q42425681999-05-11Paper
On finding a cyclic tour and a vehicle loading plan yielding maximum profit1999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q48889421996-10-30Paper
https://portal.mardi4nfdi.de/entity/Q48914621996-09-10Paper
https://portal.mardi4nfdi.de/entity/Q48528531996-03-17Paper
https://portal.mardi4nfdi.de/entity/Q43182671995-06-12Paper
https://portal.mardi4nfdi.de/entity/Q30320791988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30351331987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38044441987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37202941984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37877601984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33236581983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33236841983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38636981976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41876151974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41890431974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32152421973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40622121973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40928221973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56639121970-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: E. Kh. Gimadi