Approximation Algorithm

Related Fields

Parent Topic:

Computer Science, Mathematics, Algorithm, Mathematical optimization

Child Topic:

Metric k-center, Nearest neighbour algorithm, True quantified Boolean formula, Maximum coverage problem, Christofides algorithm, Blossom algorithm, Bin packing problem, Subset sum problem, Minimum cut, Implication graph, Continuous knapsack problem, Strongly NP-complete, PP, Partition problem, co-NP-complete, Metric dimension, Complete, Bottleneck traveling salesman problem, Complexity class, Nurse scheduling problem, Decision problem, DPLL algorithm, Longest path problem, Induced subgraph isomorphism problem, Time complexity, Unique games conjecture, Tarjan's strongly connected components algorithm, Unit disk graph, Parameterized complexity, Property testing, P versus NP problem, 3-dimensional matching, Edge cover, Randomized algorithm, Feedback arc set, Averaging argument, Steiner tree problem, PCP theorem, NP-hard, SNP, Maximum cut, Randomized rounding, UP, Pseudo-polynomial time, Traveling purchaser problem, Color-coding, Dominating set, Set packing, FP, Power graph analysis, Disjunctive normal form, Maximum subarray problem, co-NP, Promise problem, Electronic Colloquium on Computational Complexity, Nonogram, Feedback vertex set, Vertex cover, P, Conjunctive normal form, BQP, Probabilistic Turing machine, Planted motif search, Gadget, APX, Probabilistically checkable proof, Maximal independent set, Connected dominating set, Cook–Levin theorem, Boolean satisfiability problem, Domination analysis, Domatic number, Travelling salesman problem, Polynomial-time reduction, Multiprocessor scheduling, Maximum satisfiability problem, Greedy algorithm, Exponential time hypothesis, Hardness of approximation, Interval scheduling, WalkSAT, CURE data clustering algorithm, SPQR tree, MAX-3SAT, 2-satisfiability, NP-complete, Polygon covering, Interactive proof system, P-complete, Computational problem, Computational complexity theory, Covering problems, Cut, Optimization problem, Function problem, Bond graph, Data stream clustering, Computational resource, Tutte matrix, Clique problem, NC, Polynomial-time approximation scheme, Set cover problem, Linear programming relaxation, Graph center, Graph partition, NP, NL-complete, PSPACE, Kernelization, Method of conditional probabilities, PSPACE-complete

Top Authors

Paper Recommendation
1973 Outline of A New Approach To The Analysis of Complex Systems and Decision Processes

1978 Compression of individual Sequences Via Variable-rate Coding

1951 A Stochastic Approximation Method

1975 Closest-point Problems

1987 Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields

1985 Pattern-recognizing Stochastic Learning Automata

1972 Fast Allocation Algorithms

1979 Efficient Computation of Continuous Skeletons

1986 Recursive Estimation and Time-series Analysis

1977 Applications of A Planar Separator Theorem

1988 Probabilistic Construction of Deterministic Algorithms: Approximating Packing integer Programs

1992 Frequency-domain and Multirate Adaptive Filtering

1997 Stochastic Approximation Algorithms and Applications

1978 A Method For attenuation Correction in Radionuclide Computed Tomography

1994 Optimal Reactive Dispatch Through interior Point Methods

1979 A Subexponential Algorithm For The Discrete Logarithm Problem With Applications To Cryptography

2002 Maintaining Stream Statistics Over Sliding Windows

1986 Optimum Uniform Piecewise Linear Approximation of Planar Curves

1974 P-complete Problems and Approximate Solutions

1971 Optimal Algorithms For Parallel Polynomial Evaluation