Výsledky vyhledávání - "efficient approximation algorithm"
-
1
On Accuracy of Approximation for the Resource Constrained Shortest Path Problem
ISSN: 1997-1397, 2313-6022Vydáno: Krasnoyarsk Siberian Federal University 01.01.2019Vydáno v Journal of Siberian Federal University. Mathematics & Physics (01.01.2019)“…The paper we considers the Resource Constrained Shortest Path problem (RCSP). This problem is NP- hard extension of a well-known shortest path problem in the…”
Získat plný text
Journal Article -
2
An approximation algorithm for solving a problem of search for a vector subset
ISSN: 1990-4789, 1990-4797Vydáno: Dordrecht SP MAIK Nauka/Interperiodica 01.01.2012Vydáno v Journal of applied and industrial mathematics (01.01.2012)“…One of the problems in data analysis was earlier reduced to a specific NP-hard optimization problem of finding in a given vector set in the Euclidean space a…”
Získat plný text
Journal Article -
3
An approximation algorithm for solving a problem of cluster analysis
ISSN: 1990-4789, 1990-4797Vydáno: Dordrecht SP MAIK Nauka/Interperiodica 01.10.2011Vydáno v Journal of applied and industrial mathematics (01.10.2011)“…The authors provide some 2-approximation algorithm for an intractable problem to which one can reduce the problem of partitioning a vector set in Euclidean…”
Získat plný text
Journal Article -
4
Approximation algorithms for some intractable problems of choosing a vector subsequence
ISSN: 1990-4789, 1990-4797Vydáno: Dordrecht SP MAIK Nauka/Interperiodica 01.10.2012Vydáno v Journal of applied and industrial mathematics (01.10.2012)“…We consider some intractable optimization problems of finding a subsequence in a finite sequence of vectors of the Euclidean space. We assume that the sought…”
Získat plný text
Journal Article -
5
Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing
ISSN: 1063-6692, 1558-2566Vydáno: New York IEEE 01.06.2008Vydáno v IEEE/ACM transactions on networking (01.06.2008)“…We study the multi-constrained quality-of-service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K ges…”
Získat plný text
Journal Article -
6
Finding a Path Subject to Many Additive QoS Constraints
ISSN: 1063-6692, 1558-2566Vydáno: New York IEEE 01.02.2007Vydáno v IEEE/ACM transactions on networking (01.02.2007)“…A fundamental problem in quality-of-service (QoS) routing is to find a path between a source-destination node pair that satisfies two or more end-to-end QoS…”
Získat plný text
Journal Article -
7
Efficient antenna allocation algorithms in millimetre wave wireless communications
ISSN: 1751-8628, 1751-8636Vydáno: The Institution of Engineering and Technology 20.03.2018Vydáno v IET communications (20.03.2018)“…Recently, a considerable research interest has grown up in the millimetre wave wireless system as the most promising technologies in the next generation…”
Získat plný text
Journal Article -
8
Multiconstrained QoS Routing: Greedy is Good
ISBN: 1424410428, 9781424410422ISSN: 1930-529XVydáno: IEEE 01.11.2007Vydáno v IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference (01.11.2007)“…A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ges 2 additive QoS…”
Získat plný text
Konferenční příspěvek

