Greedy algorithms: a review and open problems

Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of inequalities and applications Ročník 2025; číslo 1; s. 11 - 22
Hlavní autor: García, Andrea
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 03.02.2025
Springer Nature B.V
SpringerOpen
Témata:
Algorithms
Analysis
Applications of Mathematics
Approximation
Banach spaces
Chebyshev approximation
Computer science
Data compression
Dictionaries
Greedy algorithm
Greedy algorithms
Greedy bases
Hilbert space
Mathematics
Mathematics and Statistics
Optimization
Review
Greedy algorithm
Greedy bases
41A46
46B15
41A65
ISSN:1029-242X, 1025-5834, 1029-242X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p -Banach spaces with 0 < p ≤ 1 . In both cases, we conclude by posing several questions for future research.
AbstractList Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p-Banach spaces with 0<p≤1. In both cases, we conclude by posing several questions for future research.
Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p -Banach spaces with $0< p\leq 1$ 0 < p ≤ 1 . In both cases, we conclude by posing several questions for future research.
Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p -Banach spaces with 0 < p ≤ 1 . In both cases, we conclude by posing several questions for future research.
Abstract Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p-Banach spaces with 0 < p ≤ 1 $0< p\leq 1$ . In both cases, we conclude by posing several questions for future research.
ArticleNumber 11
Author García, Andrea
Author_xml – sequence: 1
  givenname: Andrea
  surname: García
  fullname: García, Andrea
  email: andrea.garciapons@usp.ceu.es
  organization: Universidad San Pablo-CEU, CEU Universities, Departamento de Matemáticas, CUNEF Universidad
BookMark eNp9kE9LxDAQxYMouK5-AU8Fz9VkkiaNNxH_geBFwVuYNMnapdusSVX89tatonjwNMPwfo83b49s97H3hBwyesxYLU8y41LSkkJVUg6VKNkWmTEKugQBj9u_9l2yl_OSUmC8FjNSXiXv3XuB3SKmdnha5dMCi-RfW_9WYO-KuPZ9sU7Rdn6V98lOwC77g685Jw-XF_fn1-Xt3dXN-dlt2QjQQxm4FCEoaxGDoloBd5XS2jGGrgmogUrBtHUKFLJQVSAcE1ZLF4JUEj2fk5vJ10VcmnVqV5jeTcTWbA4xLQymoW06bxQEq1EIXnMrGnQYwALWlW0YgA6fXkeT1_jE84vPg1nGl9SP8Q1nklNRU6VGVT2pmhRzTj6Yph1waGM_JGw7w6j5LNpMRZuxaLMp2rARhT_od-B_IT5BeRT3C59-Uv1DfQDVNZE3
CitedBy_id crossref_primary_10_3390_s25082579
crossref_primary_10_3390_forecast7030049
Cites_doi 10.1017/CBO9780511762291
10.4064/sm200402-20-8
10.1006/jath.2000.3512
10.1017/fms.2014.7
10.4064/sm159-1-4
10.1016/j.jat.2014.09.001
10.1007/s00365-018-9415-9
10.1016/j.jat.2005.09.017
10.1007/s00041-023-09997-z
10.1016/j.na.2021.112294
10.1007/s00365-002-0525-y
10.1016/j.jat.2017.10.006
10.1002/nla.1948
10.1515/dema-2024-0047
10.1007/s43034-024-00397-y
10.1007/s13163-016-0204-3
10.1016/j.jmaa.2018.09.065
10.4064/sm159-1-7
10.1007/BF02124742
ContentType Journal Article
Copyright The Author(s) 2025
Copyright Springer Nature B.V. Dec 2025
Copyright_xml – notice: The Author(s) 2025
– notice: Copyright Springer Nature B.V. Dec 2025
DBID C6C
AAYXX
CITATION
7TB
8FD
8FE
8FG
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
GNUQQ
HCIFZ
JQ2
K7-
KR7
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOA
DOI 10.1186/s13660-025-03254-1
DatabaseName Springer Nature OA Free Journals
CrossRef
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Engineering Research Database
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Civil Engineering Abstracts
ProQuest Engineering Collection
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Civil Engineering Abstracts
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Mathematics
Computer Science
EISSN 1029-242X
EndPage 22
ExternalDocumentID oai_doaj_org_article_72fb9a44383b4cadaf2b2a85bc1229fe
10_1186_s13660_025_03254_1
GroupedDBID -A0
0R~
29K
2WC
4.4
40G
5GY
5VS
8FE
8FG
8R4
8R5
AAFWJ
AAJSJ
AAKKN
ABDBF
ABEEZ
ABFTD
ABJCF
ACACY
ACGFO
ACGFS
ACIPV
ACIWK
ACUHS
ACULB
ADBBV
ADINQ
AENEX
AFGXO
AFKRA
AFPKN
AHBYD
AHYZX
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMTXH
ARAPS
BCNDV
BENPR
BGLVJ
C24
C6C
CCPQU
CS3
D-I
DU5
EBLON
EBS
ESX
GROUPED_DOAJ
HCIFZ
J9A
K6V
K7-
KQ8
L6V
M7S
M~E
OK1
P2P
P62
PIMPY
PROAC
PTHSS
Q2X
REM
RHU
RNS
RSV
SMT
SOJ
TUS
U2A
~8M
AASML
AAYXX
AFFHD
AMVHM
CITATION
OVT
PHGZM
PHGZT
PQGLB
7TB
8FD
ABUWG
AZQEC
DWQXO
FR3
GNUQQ
JQ2
KR7
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c429t-f364ff7bbaaf709723d5799d11adcfa9206419bd727a1f5524d14b96dff676ae3
IEDL.DBID DOA
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001411955600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1029-242X
1025-5834
IngestDate Fri Oct 03 12:53:18 EDT 2025
Sat Oct 18 22:46:58 EDT 2025
Sat Nov 29 06:10:40 EST 2025
Tue Nov 18 22:20:52 EST 2025
Fri Feb 21 02:38:13 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Greedy algorithm
Greedy bases
41A46
46B15
41A65
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c429t-f364ff7bbaaf709723d5799d11adcfa9206419bd727a1f5524d14b96dff676ae3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://doaj.org/article/72fb9a44383b4cadaf2b2a85bc1229fe
PQID 3163048077
PQPubID 237789
PageCount 22
ParticipantIDs doaj_primary_oai_doaj_org_article_72fb9a44383b4cadaf2b2a85bc1229fe
proquest_journals_3163048077
crossref_citationtrail_10_1186_s13660_025_03254_1
crossref_primary_10_1186_s13660_025_03254_1
springer_journals_10_1186_s13660_025_03254_1
PublicationCentury 2000
PublicationDate 2025-02-03
PublicationDateYYYYMMDD 2025-02-03
PublicationDate_xml – month: 02
  year: 2025
  text: 2025-02-03
  day: 03
PublicationDecade 2020
PublicationPlace Cham
PublicationPlace_xml – name: Cham
– name: Heidelberg
PublicationTitle Journal of inequalities and applications
PublicationTitleAbbrev J Inequal Appl
PublicationYear 2025
Publisher Springer International Publishing
Springer Nature B.V
SpringerOpen
Publisher_xml – name: Springer International Publishing
– name: Springer Nature B.V
– name: SpringerOpen
References S.J. Dilworth (3254_CR14) 2003; 159
F. Albiac (3254_CR1) 2017; 30
S.J. Dilworth (3254_CR15) 2003; 19
F. Albiac (3254_CR2) 2021; 560
T. Aoki (3254_CR4) 1942; 18
P.M. Berná (3254_CR10) 2025; 16
P.M. Berná (3254_CR9) 2018; 48
S.V. Konyagin (3254_CR19) 2002; 28
S.V. Konyagin (3254_CR20) 2003; 159
M. Berasategui (3254_CR5) 2021; 208
M. Berasategui (3254_CR6) 2023; 29
J.D. Blanchar (3254_CR12) 2015; 22
V.N. Temlyakov (3254_CR23) 2011
P.M. Berná (3254_CR7) 2019; 470
S.J. Dilworth (3254_CR16) 2014; 188
P.M. Berná (3254_CR11) 2024; 57
P. Wojtaszczyk (3254_CR26) 2003
G. Kerkyacharian (3254_CR17) 2006; 12
F. Albiac (3254_CR3) 2006; 138
S.V. Konyagin (3254_CR18) 1999; 3
T. Oikhberg (3254_CR21) 2018; 255
P. Wojtaszczyk (3254_CR25) 2000; 107
R.A. DeVore (3254_CR13) 1996; 5
V.N. Temlyakov (3254_CR24) 2014; 2
P.M. Berná (3254_CR8) 2021; 259
S. Rolewicz (3254_CR22) 1957; 5
References_xml – volume-title: Greedy Approximation
  year: 2011
  ident: 3254_CR23
  doi: 10.1017/CBO9780511762291
– volume: 259
  start-page: 225
  year: 2021
  ident: 3254_CR8
  publication-title: Stud. Math.
  doi: 10.4064/sm200402-20-8
– volume: 107
  start-page: 293
  year: 2000
  ident: 3254_CR25
  publication-title: J. Approx. Theory
  doi: 10.1006/jath.2000.3512
– volume: 2
  year: 2014
  ident: 3254_CR24
  publication-title: Forum Math. Sigma
  doi: 10.1017/fms.2014.7
– volume: 159
  start-page: 67
  issue: 1
  year: 2003
  ident: 3254_CR14
  publication-title: Stud. Math.
  doi: 10.4064/sm159-1-4
– volume: 560
  start-page: 1
  year: 2021
  ident: 3254_CR2
  publication-title: Diss. Math.
– volume: 188
  start-page: 39
  year: 2014
  ident: 3254_CR16
  publication-title: J. Approx. Theory
  doi: 10.1016/j.jat.2014.09.001
– volume: 12
  start-page: 103
  year: 2006
  ident: 3254_CR17
  publication-title: East J. Approx.
– volume: 3
  start-page: 365
  year: 1999
  ident: 3254_CR18
  publication-title: East J. Approx.
– volume: 48
  start-page: 415
  issue: 3
  year: 2018
  ident: 3254_CR9
  publication-title: Constr. Approx.
  doi: 10.1007/s00365-018-9415-9
– volume: 5
  start-page: 471
  year: 1957
  ident: 3254_CR22
  publication-title: Bull. Acad. Polon. Sci. Cl. III
– volume: 138
  start-page: 65
  issue: 1
  year: 2006
  ident: 3254_CR3
  publication-title: J. Approx. Theory
  doi: 10.1016/j.jat.2005.09.017
– volume: 29
  year: 2023
  ident: 3254_CR6
  publication-title: J. Fourier Anal. Appl.
  doi: 10.1007/s00041-023-09997-z
– volume: 28
  start-page: 305
  year: 2002
  ident: 3254_CR19
  publication-title: Serdica Math. J.
– volume: 208
  year: 2021
  ident: 3254_CR5
  publication-title: Nonlinear Anal.
  doi: 10.1016/j.na.2021.112294
– volume: 19
  start-page: 575
  year: 2003
  ident: 3254_CR15
  publication-title: Constr. Approx.
  doi: 10.1007/s00365-002-0525-y
– volume: 255
  start-page: 176
  year: 2018
  ident: 3254_CR21
  publication-title: J. Approx. Theory
  doi: 10.1016/j.jat.2017.10.006
– volume: 22
  start-page: 254
  year: 2015
  ident: 3254_CR12
  publication-title: Numer. Linear Algebra Appl.
  doi: 10.1002/nla.1948
– volume: 57
  issue: 1
  year: 2024
  ident: 3254_CR11
  publication-title: Demonstr. Math.
  doi: 10.1515/dema-2024-0047
– volume: 16
  start-page: 7
  year: 2025
  ident: 3254_CR10
  publication-title: Ann. Funct. Anal.
  doi: 10.1007/s43034-024-00397-y
– volume: 18
  start-page: 588
  year: 1942
  ident: 3254_CR4
  publication-title: Proc. Imp. Acad. (Tokyo)
– volume: 30
  start-page: 13
  issue: 1
  year: 2017
  ident: 3254_CR1
  publication-title: Rev. Mat. Complut.
  doi: 10.1007/s13163-016-0204-3
– start-page: 136
  volume-title: Constructive Theory of Functions
  year: 2003
  ident: 3254_CR26
– volume: 470
  start-page: 218
  issue: 1
  year: 2019
  ident: 3254_CR7
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/j.jmaa.2018.09.065
– volume: 159
  start-page: 143
  year: 2003
  ident: 3254_CR20
  publication-title: Stud. Math.
  doi: 10.4064/sm159-1-7
– volume: 5
  start-page: 173
  issue: 2–3
  year: 1996
  ident: 3254_CR13
  publication-title: Adv. Comput. Math.
  doi: 10.1007/BF02124742
SSID ssj0021384
ssib044744598
ssib008501289
Score 2.374732
SecondaryResourceType review_article
Snippet Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal...
Abstract Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally...
SourceID doaj
proquest
crossref
springer
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 11
SubjectTerms Algorithms
Analysis
Applications of Mathematics
Approximation
Banach spaces
Chebyshev approximation
Computer science
Data compression
Dictionaries
Greedy algorithm
Greedy algorithms
Greedy bases
Hilbert space
Mathematics
Mathematics and Statistics
Optimization
Review
SummonAdditionalLinks – databaseName: Computer Science Database
  dbid: K7-
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LTxUxFG4UXbgB8RGvIumCnTZM31M3RoiEBEJcqGHXnL7QBO_FO1cS_71tb2cIJrJx206bmTlfz_n6Oh9Ce1JD6HMkI9B3iQjddcT5BCTlYB0D10ZXbcCvp_rsrD8_N5_agtvQjlWOPrE66rDwZY18n2fiUO8_6_dXP0lRjSq7q01C4z56QBmjBecnmkx46mVxv1O4FkILIc20y5AbVEViWiRdZc_FeKmmV_sD5Up1pNR0PE-iCL0VuGp-_1uk9K991Bqejrb-98Meo81GTPGHNZK20b04f4K2GknFzQUMuWjUgRjLniJSDu-E3xguL3LHq28_hncY8PpSDIZ5wEWiCzfpmuEZ-nL08fPhMWkyDMTnYLUiiSuRknYOIOmS7YcHqY0JlELIZjUssxpqXMhMCGiSkolAhTMqpKS0gsifo435Yh5fIMwzIAR0XHghBcTktFeOmVhYpom0myE6_mPrW47yIpVxaetcpVd2bReb7WKrXSydoTdTm6t1ho47nz4oppueLNm1a8FieWHbYLWaJWdAlCyuTngIkJhj0EvnM8pMijO0M5rStiE_2Bs7ztDbEQw31f9-pZd39_YKPWIVhiwjcQdtrJa_4mv00F-vvg_L3Qr4P4os_v0
  priority: 102
  providerName: ProQuest
– databaseName: Springer Journals Complete - Open Access
  dbid: C24
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NTxUxEJ8Q5KAHENTwEE0P3rRx-7HtlpsQiQchHtRwa6bbFkngPfL2QeJ_T9vXfQSjJnrdnSbNfHR-k3Z-A_Cm1ei7lMkodk2kUjcNdX1EGlOyDl5oo8tswO-f9elpd3ZmvtSmsGF87T5eSZaTuoR1p94PTCjV0Dx-tRGprKGp5nnUss5kvz7KPQ61zGKik2N7zG_XPUhBhan_Abz85Ua0JJrjrf_b4lPYrMCSfFh6wjashekObFWQSWoIDzvw5GRF1Do8A5rf3fifBC_PZ_OLxY-r4YAgWfazEJx6kqdrkTp1ZngO344_fj36ROsEBdqnPLOgUSgZo3YOMepM1CN8q43xjKFPFjE8ARJmnE8gBllsWy49k84oH6PSCoN4AevT2TTsAhHJlhIbIXvZSgzR6V45bkIGiCawZgJsVKrtK714nnJxaUuZ0Sm71I5N2rFFO5ZN4O1qzfWSXOOv0ofZVivJTIxdPszm57bGmdU8OoMyE7A62aPHyB3HrnU949zEMIH90dK2RutgRQKlpbdeT-DdaNn733_e0t6_ib-Ex7w4B0_-sQ_ri_lNeAUb_e3iYpi_Ll58B5ur6ew
  priority: 102
  providerName: Springer Nature
Title Greedy algorithms: a review and open problems
URI https://link.springer.com/article/10.1186/s13660-025-03254-1
https://www.proquest.com/docview/3163048077
https://doaj.org/article/72fb9a44383b4cadaf2b2a85bc1229fe
Volume 2025
WOSCitedRecordID wos001411955600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: DOA
  dateStart: 20050101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044744598
  issn: 1029-242X
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: P5Z
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: K7-
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: M7S
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: BENPR
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: PIMPY
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: C24
  dateStart: 20051201
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NbxUhFL3R6sKN38an9YWFOyUdPgYGd7Zpo1FfJn6luiEwgJrUV9N5mvjvvTBMtSbqxg2LGSYh5wL33AycA3C_1S50mMmo65pEpW4a6ofkaMJkHYPQRhdvwLfP9WrVHR6a_herr3wmbJIHnoDb0Tx542RW1PRycMEl7rnrWj8wzk2KefdF1jMXU7XUYqKT8xWZTu2MTCjV0Gzd2ggsiSg7k4aKWv8ZivnbX9GSbA6uwuXKEsnjaXTX4FxcX4crlTGSuh7HG0DzsZnwnbijD8dY5X_8PD4ijkzXUYhbB5LNsUg1jRlvwpuD_dd7T2g1QKADpokNTULJlLT3ziWddXZEaLUxgTEXEFDDkU8w4wNyEMdS23IZmPRGhZSUVi6KW7C1Pl7H20AEhkK6RshBttLF5PWgPDcx8zsTWbMANuNhh6oOnk0qjmypEjplJwwtYmgLhpYt4MHpN18mbYy_9t7NMJ_2zLrW5QFG29Zo239FewHbc5BsXWyjFcgpy9V4vYCHc-B-vv7zkO78jyHdhUu8TCyOc2sbtjYnX-M9uDh823waT5ZwYXd_1b9cwvk9LpdlkmL7TNNlPmX6Ctu-fY-9-qcv-nc_ABIH6eQ
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JbhQxEC2FgAQXwhYxEMAHOIGV9tLtdiQUhSVKNMOIQ0C5Ga8BKcyE6QGUn8o3YruXKEjklgNX223Z7VeLl6oH8LwU2tXRkmFdFwFzURTY2KBxiMbaOyakyNyAnydiOq0PD-XHFTjrY2HSs8peJ2ZF7eY2nZFvsug45PhnsX3yAyfWqHS72lNotLAY-9PfccvWvN5_F9f3BaW77w_e7uGOVQDbqHuXOLCKhyCM0TqIlLyGuVJI6QjRLo5S0mikiTQuGnZNQllS7gg3snIhVKLSnsV-r8F1zmqRcvWPBR7wW5dJ3Q_uAeeC81IOtxqUsMyATBKFbFkz3gfx1NVmQ1hVFTjVFCxu2jC5YCgzn8AFJ_ive9tsDnfX_rcfeQdud4432mkl5S6s-Nk9WOuccNSpuCYW9TwXfdl9wOlxkjtF-vgoTmT59XuzhTRqg36QnjmUKMhQR83TPIBPVzKPdVidzWf-ISAWAc91wbjlJdc-GGErQ6VPXrT0pBgB6ddU2S4He6ICOVZ5L1ZXqsWBijhQGQeKjODl8M1Jm4Hk0tZvElSGlil7eC6YL45Up4yUoMFIzVOWWsOtdjpQQ3VdGksolcGPYKOHjupUWqPOcTOCVz34zqv_PaRHl_f2DG7uHXyYqMn-dPwYbtEsAjRKwQasLhc__RO4YX8tvzWLp1nYEHy5alD-AUAxXQ8
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JbxMxFH4qBSEulFUECvgAJ7Ay3sbjSlUFlIgqVdQDoN6MPbYLUklKJoD61_h1tT1LVSR664Gr7bHs8fcWL-99AC-ENK6KlgybqgiYy6LAtg4Gh2isvWNSycwN-HlfzmbV4aE6WIM_fSxMelbZ68SsqN2iTmfkYxYdhxz_LMehexZxsDvZOfmBE4NUumnt6TRaiEz96e-4fWu293bjWr-kdPL-47sPuGMYwHXUwyscWMlDkNYaE2RKZMOckEo5QoyLI1Y0GmyirItG3pAgBOWOcKtKF0IpS-NZ7PcaXI9WWCQZm0o8YLkSSfUPrgLnknOhhhsOSlhmQyaJTlZUjPcBPVU5bggrywKnmoLFDRwmF4xm5ha44BD_dYebTeNk43_-qXfgdueQozetBN2FNT-_Bxudc4461dfEop7_oi-7Dzg9WnKnyBwfxYmsvn5vtpBBbTAQMnOHEjUZ6ih7mgfw6Urm8RDW54u5fwSIRUHgpmC85oIbH6ysS0uVT9618qQYAenXV9ddbvZEEXKs8x6tKnWLCR0xoTMmNBnBq-GbkzYzyaWt3ybYDC1TVvFcsFge6U5JaUmDVYan7LWW18aZQC01lbA1oVQFP4LNHka6U3WNPsfQCF73QDyv_veQHl_e23O4GbGo9_dm0ydwi2ZpoFEgNmF9tfzpn8KN-tfqW7N8luUOwZerxuQZ4-9lyQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Greedy+algorithms%3A+a+review+and+open+problems&rft.jtitle=Journal+of+inequalities+and+applications&rft.au=Andrea+Garc%C3%ADa&rft.date=2025-02-03&rft.pub=SpringerOpen&rft.eissn=1029-242X&rft.volume=2025&rft.issue=1&rft.spage=1&rft.epage=22&rft_id=info:doi/10.1186%2Fs13660-025-03254-1&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_72fb9a44383b4cadaf2b2a85bc1229fe
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1029-242X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1029-242X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1029-242X&client=summon