Simultaneous Approximation by Greedy Algorithms

Advances in Computational Mathematics - Netherlands
doi 10.1007/s10444-004-7613-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Nature

Related search

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Beware Greedy Algorithms

Journal of Animal Ecology
EvolutionEcologySystematicsAnimal ScienceBehaviorZoology
2019English

Approximation Algorithms Inspired by Kernelization Methods

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Simultaneous Diophantine Approximation

Journal of the Australian Mathematical Society
Mathematics
1977English

Greedy-Like Algorithms in Modal Kleene Algebra

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Adaptive Stochastic Approximation by the Simultaneous Perturbation Method

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2000English

Greedy Algorithms for Optimizing Multivariate Horner Schemes

ACM SIGSAM Bulletin
2004English

Adaptive Stochastic Approximation by the Simultaneous Perturbation Method

English

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

SIAM Journal on Computing
MathematicsComputer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy