Approximation Algorithms Publications

Publications in Approximation Algorithms

Explore the most influential research papers and scholarly works that have shaped Approximation Algorithms. Use the concept filter below to focus on a specific sub-area of research.

Approximation Algorithms

2.2K

Publications

170K

Citations

Showing yearly statistics from 2000-2026.

Page 1

	Year	Citations
Bootstrap Methods: Another Look at the Jackknife B. Efron The Annals of Statistics EngineeringMachine LearningSampling OptimizationStatistical FoundationStatistical Analysis	1979	17.1K
Monotone Operators and the Proximal Point Algorithm R. T. Rockafellar SIAM Journal on Control and Optimization Mathematical ProgrammingNumerical AnalysisEngineeringVariational AnalysisHilbert Space	1976	3.6K
Approximation Algorithms for NP-Hard Problems Dorit S. Hochba ACM SIGACT News Mathematical ProgrammingEngineeringPerformance GuaranteeUncertainty QuantificationApproximate Computing	1997	3.1K
Routing of multipoint connections Bernard M. Waxman IEEE Journal on Selected Areas in Communications Network Routing AlgorithmNetwork FlowsNetwork ScienceEngineeringNetwork Routing	1988	2.8K
Updating quasi-Newton matrices with limited storage Jorge Nocedal Mathematics of Computation Numerical AnalysisNumerical ComputationEngineeringQuasi-newton MatricesMatrix Analysis	1980	2.6K
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation James C. Spall IEEE Transactions on Automatic Control Numerical AnalysisSa AlgorithmNumerical ComputationEngineeringMultivariate Gradient Equation	1992	2.2K
Approximation algorithms for combinatorial problems David S. Johnson Journal of Computer and System Sciences EngineeringCombinatorial ProblemComputational ComplexityCombinatorial MethodApproximation Method	1974	2.2K
Inexact Newton Methods Ron S. Dembo, Stanley C. Eisenstat, Trond Steihaug SIAM Journal on Numerical Analysis Numerical AnalysisClassical AlgorithmNumerical ComputationEngineeringNewton Equations	1982	1.5K
Complexity of vehicle routing and scheduling problems Jan Karel Lenstra, A. H. G. Rinnooy Kan Networks Vehicle RoutingNp‐hardness ResultsEngineeringScheduling ProblemRoute Planning	1981	1.3K
Using the matrix pencil method to estimate the parameters of a sum of complex exponentials Tapan K. Sarkar, O.J.B. Almeida Pereira IEEE Antennas and Propagation Magazine Numerical AnalysisParameter EstimationEngineeringSpectrum EstimationNumerical Computation	1995	1.2K
Iterative Methods by Space Decomposition and Subspace Correction Jinchao Xu SIAM Review Numerical AnalysisNumerical ComputationEngineeringSuccessive Subspace CorrectionComputer Engineering	1992	1.1K
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems Sanjeev Arora Journal of the ACM EngineeringFixed DimensionsComputational ComplexityEuclidean TspDiscrete Optimization	1998	1.1K

Page 1