Search results for "Approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Zi Xu	A combined direction stochastic approximation algorithm.	Optim. Lett.	2010	DBLP DOI BibTeX RDF	Robbins-Monro algorithm, Combined direction, Almost sure, Asymptotic rate of convergence, Stochastic approximation
21	Patrick O. Stalph, Jérémie Rubinsztajn, Olivier Sigaud, Martin V. Butz	A comparative study: function approximation with LWPR and XCSF.	GECCO (Companion)	2010	DBLP DOI BibTeX RDF	lwpr, function approximation, xcsf
21	Zhi-Zhong Chen, Lusheng Wang 0001, Zhanyong Wang	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.	Algorithmica	2009	DBLP DOI BibTeX RDF	Duplication models, Approximation algorithms, Tandem repeats
21	Xujin Chen, Bo Chen 0002	Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.	Algorithmica	2009	DBLP DOI BibTeX RDF	Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee
21	Julián Mestre	A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Vertex cover, Primal-dual algorithms
21	Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis	Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Set cover
21	Imed Kacem	Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Non-availability constraint, Scheduling, Approximation, Makespan
21	Zhou Xu 0001, Liang Xu	Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.	ISAAC	2009	DBLP DOI BibTeX RDF	min-max vehicle routing, approximation algorithm, inapproximability, path covers
21	Zhipeng Cai 0001, Randy Goebel, Guohui Lin	Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem.	COCOA	2009	DBLP DOI BibTeX RDF	Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning
21	Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito	An improved constant-time approximation algorithm for maximum matchings.	STOC	2009	DBLP DOI BibTeX RDF	constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
21	Junmin Zhu	Approximation for minimum total dominating set.	ICIS	2009	DBLP DOI BibTeX RDF	minimum total dominating set, approximation, reduction
21	Lei Chen 0009, Lifeng Zhou, Hung Keng Pung	Universal Approximation and QoS Violation Application of Extreme Learning Machine.	Neural Process. Lett.	2008	DBLP DOI BibTeX RDF	Extreme learning machine (ELM), Randomhidden neurons, QoS, Radial basis function (RBF), Feedforward neural network, Universal approximation
21	Zhi-Zhong Chen	Approximation Algorithms for Bounded Degree Phylogenetic Roots.	Algorithmica	2008	DBLP DOI BibTeX RDF	Phylogenetic roots, Approximation algorithms, Randomized algorithms, Graph algorithms, Computational biology, Phylogenies
21	Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil	A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem.	SSS	2008	DBLP DOI BibTeX RDF	Approximation, Maximum matching, Self-stabilizing algorithm
21	Fengjun Li	Function Approximation by Neural Networks.	ISNN (1)	2008	DBLP DOI BibTeX RDF	neural networks, approximation, radial basis function, convolution
21	Shai Gutner	Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.	COCOA	2008	DBLP DOI BibTeX RDF	prize collecting Steiner tree problem, Approximation algorithms, primal-dual, local ratio
21	Jittat Fakcharoenphol, Bundit Laekhanukit	An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design
21	Fumitaka Higuchi, Shuichi Gofuku, Takashi Maekawa, Harish Mukundan, Nicholas M. Patrikalakis	Approximation of involute curves for CAD-system processing.	Eng. Comput.	2007	DBLP DOI BibTeX RDF	Circle involute curves, Involute gears, Chebyshev approximation formula, Bézier curves
21	Oliver Salazar Celis, Annie A. M. Cuyt, Brigitte Verdonk	Rational approximation of vertical segments.	Numer. Algorithms	2007	DBLP DOI BibTeX RDF	Noise interval, Polyhedral cone, Optimization, Modeling, Quadratic programming, Rational approximation, Rational interpolation
21	Zhi-Zhong Chen, Takayuki Nagoya	Improved approximation algorithms for metric MaxTSP.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Max TSP, Metric Max TSP, Approximation Algorithms, Randomized Algorithms, TSP, Derandomization
21	Retsef Levi, Andrea Lodi 0001, Maxim Sviridenko	Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.	IPCO	2007	DBLP DOI BibTeX RDF	scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics
21	Song Guo 0001, Oliver W. W. Yang, Victor C. M. Leung	Approximation algorithms for longest-lived directional multicast communications in WANETs.	MobiHoc	2007	DBLP DOI BibTeX RDF	maximum-lifetime routing, approximation algorithm, wireless ad hoc networks, directional antenna, multicast tree
21	Junqing Yang, Min Zhou, Xiaohong An, Lining Zhang	Offset Approximation Algorithm for Subdivision Surfaces.	SNPD (3)	2007	DBLP DOI BibTeX RDF	approximation, error, Subdivision, offset, self-intersection
21	Sheela Ramanna, Andrzej Skowron, James F. Peters	Approximation Space-Based Socio-Technical Conflict Model.	RSKT	2007	DBLP DOI BibTeX RDF	rough sets, requirements engineering, conflicts, Approximation spaces
21	Sanjeev Arora, George Karakostas	A 2 + epsilon approximation algorithm for the k-MST problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	k-Minimum Spanning Tree, Primal-Dual schema, Approximation algorithm
21	Ming Li 0017, Xiao-Shan Gao, Shang-Ching Chou	Quadratic approximation to plane parametric curves and its application in approximate implicitization.	Vis. Comput.	2006	DBLP DOI BibTeX RDF	Approximate implicitization, Parametric curves, Rational approximation, Conics
21	Wolfgang Hackbusch	Approximation of 1/\|\|x-y\|\| by Exponentials for Wavelet Applications (Short Communication).	Computing	2006	DBLP DOI BibTeX RDF	Approximation by exponentials, wavelets
21	Krists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis	Fast and Simple Approximation of the Diameter and Radius of a Graph.	WEA	2006	DBLP DOI BibTeX RDF	graph diameter, graph algorithms, analysis of algorithms, algorithm engineering, approximation techniques
21	Maleq Khan, Gopal Pandurangan	A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.	DISC	2006	DBLP DOI BibTeX RDF	Minimum Spanning Tree, Distributed Approximation Algorithm
21	Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson	Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure.	GECCO	2006	DBLP DOI BibTeX RDF	locally weighted learning, genetic algorithms, XCS, function approximation, LCS, recursive least squares
21	Tongjun Li	On Axiomatic Characterization of Approximation Operators Based on Atomic Boolean Algebras.	RSKT	2006	DBLP DOI BibTeX RDF	atomic Boolean algebras, rough sets, mappings, Approximation operators
21	Sheela Ramanna, James F. Peters, Andrzej Skowron	Generalized Conflict and Resolution Model with Approximation Spaces.	RSCTC	2006	DBLP DOI BibTeX RDF	conflict analysis, scope negotiation, rough sets, requirements engineering, conflict resolution, Approximation space
21	G. H. Zhao, Kok Lay Teo, K. S. Chan	Estimation of conditional quantiles by a new smoothing approximation of asymmetric loss functions.	Stat. Comput.	2005	DBLP DOI BibTeX RDF	asymmetric loss function, smooth approximation, lynx data, optimization, prediction, nonlinear time series
21	Evandro C. Bracht, Luis A. A. Meira, Flávio Keidi Miyazawa	A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	Approximation algorithms, graph labeling
21	Guohui Lin	An Improved Approximation Algorithm for Multicast k-Tree Routing.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	multicast k-tree routing, weight averaging, approximation algorithm, tree partitioning, Steiner minimum tree
21	Kenneth L. Clarkson, Kasturi R. Varadarajan	Improved approximation algorithms for geometric set cover.	SCG	2005	DBLP DOI BibTeX RDF	algorithms, approximation, set cover
21	Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco	Approximation Bounds for Black Hole Search Problems.	OPODIS	2005	DBLP DOI BibTeX RDF	black hole search, approximation algorithm, mobile agent, inapproximability, graph exploration
21	Naveen Garg 0001	Saving an epsilon: a 2-approximation for the k-MST problem in graphs.	STOC	2005	DBLP DOI BibTeX RDF	approximation algorithms, spanning trees
21	Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera 0001	On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem.	STOC	2005	DBLP DOI BibTeX RDF	probabilistic analysis of algorithms, uncapacitated facilty location problem, approximation algorithms
21	Mingyan Liu, John S. Baras	Fixed point approximation for multirate multihop loss networks with state-dependent routing.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	fixed point approximation, least loaded routing, state-dependent routing, performance modeling, blocking probability, multihop, multirate, loss network
21	Jun Qu, Radha Sarma	The continuous non-linear approximation of procedurally defined curves using integral B-splines.	Eng. Comput.	2004	DBLP DOI BibTeX RDF	Reparametrization, CAD, Approximation, Interpolation, Continuous, B-spline
21	James F. Peters, Sheela Ramanna	Approximation Space for Software Models.	Trans. Rough Sets	2004	DBLP DOI BibTeX RDF	classification, rough sets, design pattern, software model, Approximation space
21	Michael A. Bender, S. Muthukrishnan 0001, Rajmohan Rajaraman	Approximation Algorithms for Average Stretch Scheduling.	J. Sched.	2004	DBLP DOI BibTeX RDF	average stretch, approximation algorithms, Scheduling algorithms
21	David Cohen-Steiner, Pierre Alliez, Mathieu Desbrun	Variational shape approximation.	ACM Trans. Graph.	2004	DBLP DOI BibTeX RDF	Lloyd's clustering algorithm, anisotropic remeshing, geometric approximation, geometric error metrics, surfaces
21	Michael Elkin	Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem.	STOC	2004	DBLP DOI BibTeX RDF	minimum spanning tree, hardness of approximation
21	Alexander Gribov, Eugene Bodansky	A New Method of Polyline Approximation.	SSPR/SPR	2004	DBLP DOI BibTeX RDF	polylinecompression, polyline approximation, vectorization, shape analysis
21	Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna	On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks.	IPDPS	2003	DBLP DOI BibTeX RDF	Power controlled ad-hoc radio networks, Approximation algorithms, Minimum spanning tree
21	Cristina Bazgan, Refael Hassin, Jérôme Monnot	Differential Approximation for Some Routing Problems.	CIAC	2003	DBLP DOI BibTeX RDF	differential ratio, approximation algorithm, TSP, VRP
21	Jon M. Kleinberg, Éva Tardos	Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields.	J. ACM	2002	DBLP DOI BibTeX RDF	metric labeling, classification, Approximation algorithms, Markov random fields
21	Anand Srivastav, Hartmut Schroeter, Christoph Michel	Approximation Algorithms for Pick-and-Place Robots.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	pick-and-place robots, printed circuit board assembly problem, bipartite travelling salesman problem, approximation algorithms, combinatorial optimization, matching
21	Helmut Thiele	On Axiomatic Characterizations of Fuzzy Approximation Operators.	Rough Sets and Current Trends in Computing	2000	DBLP DOI BibTeX RDF	Rough sets, fuzzy rough sets, approximation operators
21	Changzhou Wang, Xiaoyang Sean Wang	Supporting Content-Based Searches on Time Series via Approximation.	SSDBM	2000	DBLP DOI BibTeX RDF	Content-based Queries, Approximation, Time Series, Similarity Search
21	Tobias Polzin, Siavash Vahdati Daneshmand	Primal-dual approaches to the Steiner problem.	APPROX	2000	DBLP DOI BibTeX RDF	dual-ascent, approximation algorithms, lower bound, relaxation, primal-dual, Steiner problem
21	Ben-yu Guo, Yuan-Ming Wang	An almost monotone approximation for a nonlinear two-point boundary value problem.	Adv. Comput. Math.	1998	DBLP DOI BibTeX RDF	nonlinear two-point problem, almost monotone approximation, nonlinear Jacobi and Gauss-Seidel iterations, 65L60, 65L10
21	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.	ISAAC	1998	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
21	Carlos F. Borges	Trichromatic approximation for computer graphics illumination models.	SIGGRAPH	1991	DBLP DOI BibTeX RDF	Seminorm, spectral power density (SPD), spectral reflectance, trichromatic approximation, tristimulus coordinates, illumination models
20	Yan-Hui Zhai, Kai-She Qu	On Characteristics of Information System Homomorphisms.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Rough set, Information system, Homomorphism, Upper approximation, Lower approximation
20	Xianyue Li, XiaoHua Xu, Feng Zou, Hongwei Du 0001, Peng-Jun Wan, Yuexuan Wang, Weili Wu 0001	A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs.	COCOA	2009	DBLP DOI BibTeX RDF	Node-weighted Steiner tree, minimum weighted connected dominating set, approximation algorithm, polynomial-time approximation scheme
20	Gesine Reinert, Michael S. Waterman	On the Length of the Longest Exact Position Match in a Random Sequence.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	Poisson approximation, mixed Poisson approximation, length of longest match, Chen-Stein method
20	Keyun Qin, Yan Gao, Zheng Pei 0001	On Covering Rough Sets.	RSKT	2007	DBLP DOI BibTeX RDF	covering rough set, covering lower approximation, covering upper approximation, representative element, Rough set
20	Bo Chen 0002, Yinyu Ye 0001, Jiawei Zhang 0006	Lot-sizing scheduling with batch setup times.	J. Sched.	2006	DBLP DOI BibTeX RDF	Batch setup time, Scheduling, Approximation algorithm, Approximation scheme, Lot-sizing
20	Nikhil Bansal 0001, Amit Chakrabarti, Amir Epstein, Baruch Schieber	A quasi-PTAS for unsplittable flow on line graphs.	STOC	2006	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, resource allocation, approximation scheme, unsplittable flow
20	Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor	Asymmetric k-center is log* n-hard to approximate.	J. ACM	2005	DBLP DOI BibTeX RDF	asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation
20	Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich	Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	scheduling, approximation algorithm, makespan, polynomial time approximation scheme, flow shop
20	Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor	Asymmetric k-center is log* n-hard to approximate.	STOC	2004	DBLP DOI BibTeX RDF	asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation
20	Yutaka Ohtake, Alexander G. Belyaev, Marc Alexa, Greg Turk, Hans-Peter Seidel	Multi-level partition of unity implicits.	ACM Trans. Graph.	2003	DBLP DOI BibTeX RDF	adaptive distance, error-controlled subdivision, field approximation, partition of unity approximation, implicit modeling
20	B. John Oommen, Murali Thiyagarajah	Query Result Size Estimation Using the Trapezoidal Attribute Cardinality Map.	IDEAS	2000	DBLP DOI BibTeX RDF	query result size estimation, Trapezoidal Attribute Cardinality Map, histogram-like approximation strategy, Rectangular Attribute Cardinality Map, density function approximation, T-ACM, equi-width histograms, equi-depth histograms, R-ACM, probability, query optimization, database theory, experimental results
20	Sounaka Mishra, Kripasindhu Sikdar	On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.	IFIP TCS	2000	DBLP DOI BibTeX RDF	NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness
20	Maria Emília Telles Walter, Zanoni Dias, João Meidanis	A New Approach for Approximating the Tranposition Distance.	SPIRE	2000	DBLP DOI BibTeX RDF	transposition distance approximation, genome comparison, rearrangement distance, rearrangement events, relative gene order, similar genes, linear gene orders, breakpoint diagram, approximation algorithm, data structures, permutations, DNA, C programming language, DNA molecules
20	Hamid R. Rabiee, Rangasami L. Kashyap	Image De-Blocking with Wavelet-Based Multiresolution Analysis and Spatially Variant OS Filters.	ICIP (1)	1997	DBLP DOI BibTeX RDF	image de-blocking, wavelet-based multiresolution analysis, spatially variant OS filters, video compression algorithms, blocky image decomposition, approximation subspaces, detail subspaces, low-pass approximation image, high-pass detail images, spatially adaptive order statistic filters, blocking artifacts reduction, discrete wavelet transform, nonlinear filtering, image resolution, computationally efficient algorithm
20	David M. Bethel, Donald M. Monro	Optimum Parent Pruning in Fractal Compression.	ICIP (2)	1997	DBLP DOI BibTeX RDF	optimum parent pruning, parent blocks, zero-searching fractal transform, child block, basis function approximation, orthogonalized parent blocks, rate distortion criterion, basis approximation, complexity, searching, data compression, image compression, compression ratios, DCT coefficients, basis functions, fractal compression
20	Arie Pikaz, Its'hak Dinstein	Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	noisy digital curves, smoothed polygonal approximation, curvature function, separation point, smoothed approximation, inflection points, curve points, convex-concave sections, cusps, concave-concave sections, convex-convex sections, local minimal curvature, total curvature graphs, computational complexity, image processing, feature extraction, decomposition, smoothing, complexity analysis, planar curves, feature point detection
20	Laurent Hérault, Radu Horaud	Figure-Ground Discrimination: A Combinatorial Optimization Approach.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	figure-ground discrimination, cocircularity, image element interactions, interacting spin system, mean field approximation theory, microcanonical annealing, deterministic approximation, image processing, simulated annealing, simulated annealing, combinatorial optimization, shape, smoothness, proximity, cost function, combinatorial mathematics, contrast, stochastic methods, mean field annealing
20	Bernd-Jürgen Falkowski	Comments on an Optimal Set of Indices For a Relational Database.	IEEE Trans. Software Eng.	1992	DBLP DOI BibTeX RDF	index selection problem, classical knapsack problem, reduction process, approximation algorithm, relational database, relational databases, optimisation, database theory, approximation theory
20	Vasant A. Ubhaya	Lipschitzian Operators in Best Approximation by Bounded or Continuous Functions.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Approximation problem, Minimum distance problem, Best estimate, Continuous selection operator, Lipschitzian selection operator, Uniform norm, Quasiconvex function, Isotone functions, Majorants and minorants, Selection, Convex function, Continuous function, Best approximation, Bounded function
20	Svetlana Stolpner, Sue Whitesides	Medial Axis Approximation with Bounded Error.	ISVD	2009	DBLP DOI BibTeX RDF	Voronoi diagram approximation, distance field method, medial axis approximation
20	Bernardo Llanas, Sagrario Lantarón, Francisco J. Sáinz	Constructive Approximation of Discontinuous Functions by Neural Networks.	Neural Process. Lett.	2008	DBLP DOI BibTeX RDF	Approximation of discontinuous functions, Constructive approximation, Piecewise continuous functions, Neural networks, Gibbs phenomenon
20	A. Nersessian, Arnak V. Poghosyan	On a Rational Linear Approximation of Fourier Series for Smooth Functions.	J. Sci. Comput.	2006	DBLP DOI BibTeX RDF	pade approximation, L2-Convergence, Fourier series, rational approximation
20	Ronald W. Butler, Andrew T. A. Wood	Approximation of power in multivariate analysis.	Stat. Comput.	2005	DBLP DOI BibTeX RDF	block independence, covariance equality, general linear hypothesis, Laplace approximation, saddlepoint approximation, power function, hypergeometric functions
20	Gareth Bradshaw, Carol O'Sullivan	Adaptive medial-axis approximation for sphere-tree construction.	ACM Trans. Graph.	2004	DBLP DOI BibTeX RDF	object approximation, simulation level-of-detail, Animation, medial axis approximation, collision handling
20	Uriel Feige, Robert Krauthgamer	A polylogarithmic approximation of the minimum bisection.	FOCS	2000	DBLP DOI BibTeX RDF	polylogarithmic approximation, minimum bisection, vertex partitioning, bisection cost, computational complexity, complexity, computational geometry, graph theory, graph, edges, vertices, approximation ratio
20	Sudipto Guha	Nested Graph Dissection and Approximation Algorithms.	FOCS	2000	DBLP DOI BibTeX RDF	nested graph dissection, nested dissection paradigm, chordal completion size, polynomial term, vertex ranking, approximation algorithms, computational geometry, graph theory, polynomials, upper bound, approximation theory, planar embedding
20	Osman Abul, Faruk Polat, Reda Alhajj	Function approximation based multi-agent reinforcement learning.	ICTAI	2000	DBLP DOI BibTeX RDF	multi-agent based domain independent coordination mechanisms, coordination information, reward distribution, region-wide joint rewards, Adversarial Food-Collecting World, multi-agent environments, multi-agent systems, learning (artificial intelligence), function approximation, function approximation, state transitions, multi-agent reinforcement learning
20	Masayuki Ito, Naofumi Takagi, Shuzo Yajima	Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF	initial approximation, Computer arithmetic, division, square root, reciprocal, linear approximation
20	Sanjeev Arora	Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.	FOCS	1996	DBLP DOI BibTeX RDF	polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, k-TSP, Minimum degree-k, k-MST, computational geometry, spanning tree, Steiner Tree, best approximation, geometric problems
20	Guy Even, Joseph Naor, Leonid Zosin	An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem.	FOCS	1996	DBLP DOI BibTeX RDF	8-approximation algorithm, subset feedback vertex set problem, minimum weight, special vertices, logarithmic approximation factor, relaxed multi-commodity flow, multi-terminal flow, computational complexity, NP-Complete problems, undirected graph, multi-commodity flow, vertex weights
20	Alan M. Frieze, Ravi Kannan	The Regularity Lemma and Approximation Schemes for Dense Problems.	FOCS	1996	DBLP DOI BibTeX RDF	dense problems, polynomial time approximation, dense graphs, Graph Bisection problem, Min l-way cut problem, Graph Separator problem, Max-SNP hard problems, graph theory, approximation schemes, Quadratic Assignment Problem, regularity lemma, Max Cut problem
20	Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou	An Approximation Scheme for Planar Graph TSP.	FOCS	1995	DBLP DOI BibTeX RDF	planar unweighted graph, shortest-path metric, computational complexity, graph theory, travelling salesman problems, traveling salesman problem, polynomial-time, operations research, approximation theory, distance metric, approximation scheme
20	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm
20	Brenda S. Baker	Approximation Algorithms for NP-Complete Problems on Planar Graphs.	J. ACM	1994	DBLP DOI BibTeX RDF	partition into perfect matchings, partition into triangles, approximation algorithms, NP-complete, planar graphs, dominating set, independent set, vertex cover, approximation schemes, Hamiltonian path, Hamiltonian circuit
20	Avijit Saha, Chuan-lin Wu, Dun-Sung Tang	Approximation, Dimension Reduction, and Nonconvex Optimization Using Linear Superpositions of Gaussians.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	linear superpositions of Gaussians, neural network approaches, optimisation, radial basis function, neural nets, polynomials, function approximation, function approximation, dimension reduction, nonconvex optimization
20	Richard Chang 0001, William I. Gasarch	On Bounded Queries and Approximation	FOCS	1993	DBLP DOI BibTeX RDF	NP-optimization problems, NP oracle, maximum clique size, computational complexity, approximation, graph coloring, set cover, complexity measure, approximation factor, bounded queries
20	Sridhar Rajagopalan, Vijay V. Vazirani	Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs	FOCS	1993	DBLP DOI BibTeX RDF	randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem
20	Frank Thomson Leighton, Satish Rao	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms	FOCS	1988	DBLP DOI BibTeX RDF	max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
19	Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung	Degree Bounded Network Design with Metric Costs.	FOCS	2008	DBLP DOI BibTeX RDF
19	Anupam Gupta 0001, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi 0001	Dial a Ride from k -Forest.	ESA	2007	DBLP DOI BibTeX RDF
19	Hyoungmin Park, Kyuseok Shim	Approximate algorithms for K-anonymity.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	local recoding, data mining, anonymity, privacy preservation, data publishing
19	S. M. Kashmiri, Sandro A. P. Haddad, Wouter A. Serdijn	High-performance analog delays: surpassing Bessel-Thomson by Pade-approximated Gaussians.	ISCAS	2006	DBLP DOI BibTeX RDF
19	Adi Avidor, Uri Zwick	Approximating MIN 2-SAT and MIN 3-SAT.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
19	Jian-Jia Chen, Heng-Ruey Hsu, Kai-Hsiang Chuang, Chia-Lin Yang, Ai-Chun Pang, Tei-Wei Kuo	Multiprocessor Energy-Efficient Scheduling with Task Migration Considerations.	ECRTS	2004	DBLP DOI BibTeX RDF	Real-Time Systems, Power Management, Multiprocessor Scheduling, Energy-Efficient Scheduling, Real-Time Task Scheduling