Results 1 to 10 of about 43,512 (302)
A framework for the greedy algorithm
Discrete Applied Mathematics, 2002 Matroids are characterized by the fact that the greedy algorithm finds bases of largest weight. There are, however, optimization problems for which the greedy algorithm solves the optimization problem for many, but not all, linear weight functions and for such situations a theory is developed to efficiently identify instances on which the greedy ...
Department of Mathematics, University of Florida Little Hall, PO Box 118105, Gainesville, FL 32611-8105, USA ( host institution ) +1 more
exaly +4 more sources
Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
Mathematics, 2023 We first study the error performances of the Vector Weak Rescaled Pure Greedy Algorithm for simultaneous approximation with respect to a dictionary D in a Hilbert space.
Xu Xu +3 more
doaj +2 more sources
An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm. [PDF]
PLoS ONE, 2016 The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem.
Guangquan Lu +3 more
doaj +2 more sources
Journal of Approximation Theory, 2018 The aim of the present paper is to extend some results on greedy approximation algorithms to greedy algorithms allowing gaps in the approximating sequences. Let \(X\) be a Banach space and \((e_i,e^*_i)\in X\times X^*,\, i\in I,\) a biorthogonal system such that span\(\{e_i\}\) is dense in \(X\), span\(\{e^*_i\}\) is \(w^*\)-dense in \(X^*\) and ...
Timur Oikhberg
exaly +3 more sources
Improving Greedy Spanner Construction Algorithm [PDF]
Computer and Knowledge Engineering, 2023 In recent years, several algorithms with different time complexities have been proposed for the construction of greedy spanners. However, a not so apparently suitable algorithm with running time complexity , namely the FG algorithm, is proved to be ...
hosein salami, Mostafa Nouri Baygi
doaj +1 more source
A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2023 This study describes a novel greedy algorithm for optimizing the well-known Curriculum-Based Course Timetabling (CB-CTT) problem. Greedy algorithms are a good alternative to brute-force and evolutionary algorithms, which take a long time to execute in ...
Tansel Dökeroğlu +2 more
doaj +1 more source
A quick Heuristic and a general search algorithm for traveling salesman problem [PDF]
E3S Web of Conferences, 2022 This paper puts forward a constructive heuristic algorithm called the method of inserting the minimum neighbor edge from outside to the center (IMNEFOTC) that can be applied to solve large-scale and ultra-large-scale travelling salesman problems. Through
Wang Chao, Wang Deguang, Jin Chun
doaj +1 more source
Greedy algorithms in Datalog [PDF]
Theory and Practice of Logic Programming, 2001 In the design of algorithms, the greedy paradigm provides a powerful tool for solving efficiently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative framework of logic-based languages has proven a difficult research challenge.
GRECO, Sergio, ZANIOLO C.
openaire +4 more sources
Exact and greedy algorithms of allocating experts to maximum set of programmer teams
Системный анализ и прикладная информатика, 2022 The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem.
A. A. Prihozhy
doaj +1 more source
Confidential Greedy Graph Algorithm [PDF]
International Journal of Electronics and Telecommunications, 2018 Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage of the computation, which is very important in context of cloud computing.
Daniel Waszkiewicz +3 more
doaj +1 more source