Search Results - efficient algorithms with performance guarantees

Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph by Gimadi, Edward Kh

“… Efficient algorithms with performance guarantees are constructed for the Euclidean m-Peripatetic Salesman Problem, m-Weighted Clique Problem and m-Layer Planar three…”
Get full text

Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph by Gimadi, E. Kh, Kel’manov, A. V., Pyatkin, A. V., Khachai, M. Yu

“… An approximation algorithm for this problem is presented. We show that the algorithm finds a solution with a bounded approximation ratio for the considered subclasses of the problem, and the bound is attainable…”
Get full text

Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence by Kel'manov, Alexander

“… with performance guarantees for their solutions…”
Get full text

Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster by Kel'manov, Alexander, Khandeev, Vladimir

“…We consider the problem of 2-partitioning a finite set of points in Euclidean space minimizing the sum of squared distances between cluster elements and the…”
Get full text

Optimizing carbon footprint in long-haul heavy-duty E-Truck transportation by Su, Junyan, Lin, Qiulin, Chen, Minghua

“… We exploit these structural insights to design an efficient algorithm with performance guarantees…”
Get full text

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment by Wang, Ziao, Zhang, Ning, Wang, Weina, Wang, Lele

“… This motivates us to investigate efficient algorithms with theoretical performance guarantee. In this paper, we propose two polynomial-time algorithms that exactly recover the vertex correspondence with high probability…”
Get full text

Approximation algorithms for process systems engineering by Letsios, Dimitrios, Baltean-Lugojan, Radu, Ceccon, Francesco, Mistry, Miten, Wiebe, Johannes, Misener, Ruth

“… Designing and analyzing algorithms with provable performance guarantees enables efficient optimization problem solving in different application domains, e.g…”
Get full text

Efficient algorithm for scheduling parallel applications on hybrid multicore machines with communications delays and energy constraint by Ait Aba, Massinissa, Zaourar, Lilia, Munier, Alix

“…Summary This paper presents an efficient algorithm with performance guarantee to solve task scheduling problem on hybrid platforms with energy constraint and communication delays…”
Get full text

Scalable Contour Tree Computation by Data Parallel Peak Pruning by Carr, Hamish A., Weber, Gunther H., Sewell, Christopher M., Rubel, Oliver, Fasel, Patricia, Ahrens, James P.

“… Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems…”
Get full text

Efficient distributed broadcasting algorithms for cognitive radio networks-enabled smart agriculture by Gu, Zhaoquan, Zhang, Huan, Wang, Le, Shafiq, Muhammad, Jin, Kai

“… and the performance can be greatly affected. Cognitive Radio Networks (CRNs) are promising in promoting better spectrum utilization, where unlicensed users can opportunistically use the vacant spectrum assigned to licensed users…”
Get full text

Multiple-user closest keyword-set querying in road networks by Zhao, Sen, Cao, Xin

“…Location-based group queries have attracted increasing attention due to the prevalence of location-based services (LBS) and location-based social networks…”
Get full text

Improved Bounds for Noisy Group Testing With Constant Tests per Item by Gebhard, Oliver, Johnson, Oliver, Loick, Philipp, Rolvien, Maurice

“…The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that…”
Get full text

Dense Subgraph Discovery: Novel Algorithms and Applications by Chen, Tianyi

“…Dense subgraph discovery (DSD) is an important technique for analyzing and extracting valuable insights from large-scale graph data across various fields,…”
Get full text

Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs by Obata, Yuji, Nishizeki, Takao

“… In the paper, we present four efficient approximation algorithms for the problem, which have theoretical performance guarantees for the computation time, the span of a found b-coloring and the approximation ratio. We also obtain several upper bounds on the minimum span, expressed in terms of the maximum b-degrees, one of which is an extension of Brooks' theorem on an ordinary coloring…”
Get full text

An Efficient Local Search Heuristic for Earth Observation Satellite Integrated Scheduling by Chen, Yuning, Lu, Ji, He, Renjie, Ou, Junwei

“…) to solve problems of large size. ELSH uses a dedicated local search method to guarantee algorithm performance and efficient constraint handling mechanisms to guarantee algorithm efficiency…”
Get full text

Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Downlink Scheduling by Cohen, R., Katzir, L.

“… We propose efficient algorithms, with performance guarantee, that solve this intricate OFDMA scheduling problem by breaking it down into two subproblems, referred to as macro and micro scheduling…”
Get full text

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks by Ouyang, Dian, Wen, Dong, Qin, Lu, Chang, Lijun, Lin, Xuemin, Zhang, Ying

“… Since a direct search using the Dijkstra’s algorithm results in a large search space, researchers resort to indexing-based approaches…”
Get full text

Atomic cluster expansion: Completeness, efficiency and stability by Dusson, Geneviève, Bachmayr, Markus, Csányi, Gábor, Drautz, Ralf, Etter, Simon, van der Oord, Cas, Ortner, Christoph

“… Our presentation extends the derivation by proposing a precomputation algorithm that yields immediate guarantees that a complete basis is obtained…”
Get full text

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment by Wang, Ziao, Zhang, Ning, Wang, Weina, Wang, Lele

“… This motivates us to investigate efficient algorithms with theoretical performance guarantee. In this paper, we propose two polynomial-time algorithms that exactly recover the vertex correspondence with high probability…”
Get full text

An Efficient Influence Maximization Algorithm Based on Clique in Social Networks by Li, Huan, Zhang, Ruisheng, Zhao, Zhili, Yuan, Yongna

“… Heuristic algorithms, which are efficient in influential nodes identifying, usually cannot provide any performance guarantee…”
Get full text