The following pages link to Eh. Kh. Gimadi (Q294359):
Displaying 50 items.
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- (Q483408) (redirect page) (← links)
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above (Q492278) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space (Q735647) (← links)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101) (← links)
- Bin packing: Asymptotically exact approach (Q1282479) (← links)
- The problem of strip packing: An asymptotically exact approach (Q1282481) (← links)
- (Q1589145) (redirect page) (← links)
- Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis (Q1589147) (← links)
- Resolvability of multi-index axial assignment problem on one-cyclic substitutions (Q1603114) (← links)
- Uniform capacitated facility location problem with random input data (Q1948657) (← links)
- On PTAS for the geometric maximum connected \(k\)-factor problem (Q1982899) (← links)
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
- On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights (Q2117617) (← links)
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route (Q2261716) (← links)
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372) (← links)
- An optimal algorithm for an outerplanar facility location problem with improved time complexity (Q2424182) (← links)
- On asymptotically optimal solvability of max \(m\)-\(k\)-cycles cover problem in a normed space (Q2663723) (← links)
- A given diameter MST on a random graph (Q2679776) (← links)
- (Q2712301) (← links)
- On software and mathematical support for the resource scheduling problem for East Siberian oil and gaz industry (Q2898983) (← links)
- A facility location problem with equal amounts of production at random input data (Q2898989) (← links)
- (Q2998954) (← links)
- (Q2998976) (← links)
- (Q3032079) (← links)
- (Q3035133) (← links)
- (Q3115190) (← links)
- (Q3115218) (← links)
- (Q3115263) (← links)
- (Q3115591) (← links)
- (Q3115595) (← links)
- (Q3115611) (← links)
- (Q3115619) (← links)
- (Q3115657) (← links)
- (Q3115668) (← links)
- (Q3115676) (← links)
- (Q3115696) (← links)
- (Q3115710) (← links)
- On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs (Q3133207) (← links)
- Efficient Randomized Algorithm for a Vector Subset Problem (Q3133208) (← links)
- A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (Q3186828) (← links)
- Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (Q3186835) (← links)
- (Q3215242) (← links)
- (Q3323658) (← links)
- (Q3323684) (← links)
