Search results for "Approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
5	Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh	Degree-Constrained Subgraph Problems: Hardness and Approximation Results.	WAOA	2008	DBLP DOI BibTeX RDF	Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
5	Jianmin Ma, Wen-Xiu Zhang, Wei-Zhi Wu, Tong-Jun Li	Granular Computing Based on a Generalized Approximation Space.	RSKT	2007	DBLP DOI BibTeX RDF	Generalized approximation space, L??lower approximation operator, H??upper approximation operator, Similarity relation
5	Ashkan Aazami, Michael D. Stilp	Approximation Algorithms and Hardness for Domination with Propagation.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF	Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS
5	Dong Qiu, Lan Shu	Rough Sets of System.	ICFIE	2007	DBLP DOI BibTeX RDF	lower system approximation, upper system approximation, Rough sets, system, upper approximation, lower approximation
5	Jérôme Monnot, Sophie Toulouse	Approximation Results for the Weighted P4 Partition Problems.	FCT	2005	DBLP DOI BibTeX RDF	3-length chain, standard approximation, differential approximation, approximation algorithms, Graph partition, performance ratio
5	Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov	Best Basis Selection for Approximation in Lp.	Foundations of Computational Mathematics	2003	DBLP DOI BibTeX RDF	Best basis, n -Term approximation, Degree of approximation, Approximation classes, Democratic bases, Unconditional bases, Greedy bases, AMS Classification. 42C40, 46B70, 26B35, 42B25
5	Mauro Barni, Franco Bartolini, Fabio Buti, Vito Cappellini	Optimum linear approximation of the Euclidean norm to speed up vector median filtering. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	piecewise-linear techniques, optimum linear approximation, impulsive noise reduction, multiband images, optic flow computation, optimal piecewise linear approximation, optimisation, image sequences, color images, filtering theory, image colour analysis, square root, median filters, approximation theory, vector field, Euclidean distance, image contours, vector median filtering, vector median filter, Euclidean norm
5	Chi-hsin Wu, Peter C. Doerschuk	Application of the cluster approximation for the simultaneous restoration and segmentation of tomographic images. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	cluster approximation, Bayesian restoration algorithm, Bayesian segmentation algorithm, pixel-line Markov random field, interactions locality, medical tomography, image segmentation, image segmentation, approximation, edge detection, Markov processes, image restoration, image restoration, medical image processing, Bayes methods, random processes, approximation theory, computerised tomography, tomographic images
4	Raghu Pasupathy, Bruce W. Schmeiser	Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem.	ACM Trans. Model. Comput. Simul.	2009	DBLP DOI BibTeX RDF	Retrospective approximation, sample-average approximation, stochastic root finding
4	Yuval Rabani, Gabriel Scalosub	Bicriteria approximation tradeoff for the node-cost budget problem.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Approximation algorithms, bicriteria approximation
4	Hengwu Li	Approximation algorithm and scheme for RNA structure prediction.	Int. Conf. Interaction Sciences	2009	DBLP DOI BibTeX RDF	approximation algorithm, approximation scheme, RNA structure, pseudoknot
4	Jianping Li, Weidong Li, Jianbo Li	Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision.	COCOA	2009	DBLP DOI BibTeX RDF	Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service
4	Rolf Harren, Rob van Stee	Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	two-dimensional bin packing, absolute worst-case ratio, approximation algorithm, strip packing, rectangle packing
4	Marek Karpinski, Warren Schudy	Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems.	STOC	2009	DBLP DOI BibTeX RDF	Gale-Berlekamp game, correlation and hierarchical clustering, dense instances, linear time approximation schemes, minimum constraint satisfaction, nearest codeword problem, approximation algorithms
4	Guy Kortsarz, Zeev Nutov	Approximating Some Network Design Problems with Node Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
4	Hoang Tuy	Cutting Plane Methods for Global Optimization.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Inner approximation, Polyhedral annexation, Concavity cut, Intersection cut, Convexity cut, Nonlinear cut, Polyblock approximation, Monotonic optimization, Outer approximation, Cutting plane method
4	Nir Halman, Chung-Lun Li, David Simchi-Levi	Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	time-cost tradeoff, approximation algorithms, Project management
4	Refael Hassin, Jérôme Monnot, Danny Segev	Approximation algorithms and hardness results for labeled connectivity problems.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Labeled connectivity, Approximation algorithms, Hardness of approximation
4	Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster	Approximation algorithms and hardness results for cycle packing problems.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
4	Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang	Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems.	ICCSA	2007	DBLP DOI BibTeX RDF	approximation algorithm, polynomial time approximation scheme (PTAS), combinatorial optimization problem, k-tree
4	Joseph Cheriyan, Mohammad R. Salavatipour	Hardness and Approximation Results for Packing Steiner Trees.	Algorithmica	2006	DBLP DOI BibTeX RDF	Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems
4	Daniel Goujot	Blind Wavelet Compression of the Solution of a Nonlinear PDE with Singular Forcing Term Within Optimal Order Cost: Stability of Restricted Approximation to Small Errors.	J. Sci. Comput.	2006	DBLP DOI BibTeX RDF	restricted adaptive approximation, Besov spaces, Wavelets, nonlinear approximation, elliptic equations
4	Wang Baocang, Hu Yupu	Diophantine Approximation Attack on a Fast Public Key Cryptosystem.	ISPEC	2006	DBLP DOI BibTeX RDF	Simultaneous Diophantine approximation problem, Cryptanalysis, Public-key cryptosystem, Lattice basis reduction, Diophantine approximation
4	Abhinandan Das, Johannes Gehrke, Mirek Riedewald	Semantic Approximation of Data Stream Joins.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	semantic load shedding, set approximation error metrics, approximation algorithms, Data streams, join processing
4	Shalabh Bhatnagar	Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization.	ACM Trans. Model. Comput. Simul.	2005	DBLP DOI BibTeX RDF	Adaptive three-timescale stochastic approximation algorithms, Newton-type algorithms, simultaneous perturbation stochastic approximation, simulation optimization
4	Shalabh Bhatnagar, I. Bala Bhaskar Reddy	Optimal Threshold Policies for Admission Control in Communication Networks via Discrete Parameter Stochastic Approximation.	Telecommunication Systems	2005	DBLP DOI BibTeX RDF	regularized semi-Markov modulated Poisson process, two timescale stochastic approximation, simultaneous perturbation stochastic approximation, threshold type policies, admission control, communication networks
4	Andrzej Skowron, Jaroslaw Stepaniuk, Roman W. Swiniarski	Approximation Spaces in Machine Learning and Pattern Recognition.	PReMI	2005	DBLP DOI BibTeX RDF	Rough sets, approximation spaces, concept approximation
4	Shai Dekel, Dany Leviatan	Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation.	Foundations of Computational Mathematics	2004	DBLP DOI BibTeX RDF	Piecewise polynomial approximation, Whitney estimates, Johns theorem, Nonlinear approximation
4	Leah Epstein, Jiri Sgall	Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.	Algorithmica	2004	DBLP DOI BibTeX RDF	Machine completion time, Scheduling, Approximation algorithms, Parallel machines, Polynomial time approximation scheme
4	Michael M. Richter	Logic and Approximation in Knowledge Based Systems.	Logic versus Approximation	2004	DBLP DOI BibTeX RDF
4	Armin Stahl	Approximation of Utility Functions by Learning Similarity Measures.	Logic versus Approximation	2004	DBLP DOI BibTeX RDF
4	Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang	Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.	ICCSA	2004	DBLP DOI BibTeX RDF	approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem
4	Martin Stepnicka, Stephan Lehmke	Approximation of Fuzzy Functions by Extended Fuzzy Transforms.	Fuzzy Days	2004	DBLP DOI BibTeX RDF	Fuzzy approximation, Fuzzy transforms, Approximation, Fuzzy sets, Fuzzy control, Normal forms
4	Tuan Trung Nguyen, Andrzej Skowron	Rough Set Approach to Domain Knowledge Approximation.	RSFDGrC	2003	DBLP DOI BibTeX RDF	domain knowledge approximation, machine learning, Rough mereology, handwritten digit recognition, concept approximation
4	David Coudert, Hervé Rivano, Xavier Roche	A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.	WAOA	2003	DBLP DOI BibTeX RDF	combinatorial approximation, Multicommodity flow, incremental algorithm, dynamic shortest paths
4	Eran Halperin, Robert Krauthgamer	Polylogarithmic inapproximability.	STOC	2003	DBLP DOI BibTeX RDF	integrality ratio, polylogarithmic approximation, approximation algorithms, Steiner tree, hardness of approximation
4	Richard G. Baraniuk, Ronald A. DeVore, George Kyriazis, X. M. Yu	Near Best Tree Approximation.	Adv. Comput. Math.	2002	DBLP DOI BibTeX RDF	n-term approximation, approximation classes, compression, encoding
4	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo approximation algorithms, with applications to optimal motion planning.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	d 1-optimal motion, optimal motion planning, pseudo approximation, approximation algorithms, NP-hard problem, binary search, robot motion planning, Euclidean shortest path
4	Eran Halperin, Aravind Srinivasan	Improved Approximation Algorithms for the Partial Vertex Cover Problem.	APPROX	2002	DBLP DOI BibTeX RDF	Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
4	Jungho Yoon	Computational Aspects of Approximation to Scattered Data by Using 'Shifted' Thin-Plate Splines.	Adv. Comput. Math.	2001	DBLP DOI BibTeX RDF	shifted thin-plate spline, Gauss elimination by degree, radial basis function, scattered data approximation, approximation order
4	Rahul Garg, Vijay Kumar, Vinayaka Pandit	Approximation Algorithms for Budget-Constrained Auctions.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF	approximation algorithm, auctions, rounding, winner determination
4	Vera Kurková, Marcello Sanguineti	Comparison of Rates of Linear and Neural Network Approximation.	IJCNN	2000	DBLP DOI BibTeX RDF	linear and neural network approximation, Kolmogorov width, dimension-independent rates of approximation, perceptron networks
4	Ming-Jun Lai, Larry L. Schumaker	On the approximation power of bivariate splines.	Adv. Comput. Math.	1998	DBLP DOI BibTeX RDF	approximation order by splines, stable approximation schemes, super-splines, 41A63, 41A15, 41A25, 65D10, bivariate splines
4	Thomas Jansen	Introduction to the Theory of Complexity and Approximation Algorithms.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
4	Thomas Hofmeister, Martin Hühne	Semidefinite Programming and Its Applications to Approximation Algorithms.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
4	Hsueh-I Lu, R. Ravi	A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.	ISPAN	1997	DBLP DOI BibTeX RDF	Maximum-leaf spanning tree, Approximation algorithms, Performance guarantee, Approximation ratio
4	Joseph Naor, Leonid Zosin	A 2-Approximation Algorithm for the Directed Multiway Cut Problem.	FOCS	1997	DBLP DOI BibTeX RDF	directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor
4	Sanjeev Arora	Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.	FOCS	1997	DBLP DOI BibTeX RDF	randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems
4	Tuyen V. Nguyen, Jing Li	Multipoint Padé approximation using a rational block Lanczos algorithm.	ICCAD	1997	DBLP DOI BibTeX RDF	Lanczos vectors, expansion point, full backward orthogonalization, linear multiport networks, mixed signal design, multipoint matrix Pade approximation, multiport networks, rational block Lanczos algorithm, reduced model, reliable adaptive scheme, single frequency Pade approximation, transfer function, circuit simulation, frequency domain, digital design, analog design, Krylov subspace
4	Takuro Kida	The extended optimum interpolatory approximation of multi-dimensional signals. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	signal sampling, delay circuits, extended optimum interpolatory approximation, multidimensional signals, optimum space limited interpolation functions, space variable domain, decimated sample values, equivalent transformation, cosine modulated filter bank, linear phase filter bank, iterative linear approximation, reciprocal relation, interpolation, iterative methods, trees (mathematics), quantization, filtering theory, tree structure, band-pass filters, quantisation (signal)
4	Michael J. Schulte, Earl E. Swartzlander Jr.	Hardware Designs for Exactly Rounded Elemantary Functions.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	Chebyshev approximation, summing circuits, exactly rounded elementary functions, multi-operand adder, Chebyshev series approximation, single-precision floating point numbers, chip area, 1.0-micron CMOS technology, computational delay, exact rounding, argument reduction, computer arithmetic, digital arithmetic, polynomials, CMOS integrated circuits, multiplying circuits, square-root, hardware designs, reciprocal, approximation theory, polynomial approximation, special-purpose hardware, parallel multiplier, 1 micron
4	S. K. Michael Wong, F. C. S. Poon	Comments on Approximating Discrete Probability Distributions with Dependence Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	discrete probability distributions, product approximation, tree dependence approximation, classification, pattern recognition, pattern recognition, probability, trees (mathematics), minimization, Bayes methods, minimisation, probability distribution, approximation theory, error statistics, Bayes error rate
4	Paul S. LaFata, J. Ben Rosen	An interactive display for approximation by linear programming.	Commun. ACM	1970	DBLP DOI BibTeX RDF	linear programming, approximation, functional approximation, data fitting, graphical display, spline functions
3	Zi Xu	A combined direction stochastic approximation algorithm.	Optimization Letters	2010	DBLP DOI BibTeX RDF	Robbins-Monro algorithm, Combined direction, Almost sure, Asymptotic rate of convergence, Stochastic approximation
3	Karl Bringmann, Tobias Friedrich	The maximum hypervolume set yields near-optimal approximation.	GECCO	2010	DBLP DOI BibTeX RDF	approximation, performance measures, multiobjective optimization, hypervolume indicator
3	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
3	Woongki Baek, Trishul M. Chilimbi	Green: a framework for supporting energy-conscious programming using controlled approximation.	PLDI	2010	DBLP DOI BibTeX RDF	controlled approximation, energy-conscious programming
3	Joseph S. B. Mitchell	A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	approximation algorithm, TSP
3	Yayun Zhou, Jörg Schulze, Stefan Schäffler	Blade geometry design with kinematic ruled surface approximation.	SAC	2010	DBLP DOI BibTeX RDF	blade, dual spherical spline, geometry design, ruled surface, approximation
3	Weixun Wang, Prabhat Mishra	PreDVS: preemptive dynamic voltage scaling for real-time systems using approximation scheme.	DAC	2010	DBLP DOI BibTeX RDF	real-time systems, approximation algorithm, dynamic voltage scaling, energy-aware scheduling
3	Sundaresan Krishnan, Prasanna Chaporkar	Stochastic approximation algorithm for optimal throughput performance of wireless LANs.	SIGCOMM	2010	DBLP DOI BibTeX RDF	IEEE 802.11, stochastic approximation, hidden nodes, weighted fairness
3	Guy E. Blelloch, Kanat Tangwongsan	Parallel approximation algorithms for facility-location problems.	SPAA	2010	DBLP DOI BibTeX RDF	parallel algorithms, approximation algorithms, facility location problems
3	Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità	An improved LP-based approximation for steiner tree.	STOC	2010	DBLP DOI BibTeX RDF	approximation algorithms, randomized algorithms, network design, linear programming relaxations
3	Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss	Approximate sparse recovery: optimizing time and measurements.	STOC	2010	DBLP DOI BibTeX RDF	approximation, embedding, sketching, sublinear algorithms, sparse approximation
3	Saeid Abbasbandy, E. Ahmady, N. Ahmady	Triangular approximations of fuzzy numbers using alpha-weighted valuations.	Soft Comput.	2010	DBLP DOI BibTeX RDF	Fuzzy triangular approximation, Approximation, Fuzzy number
3	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
3	Guang Xu, Jinhui Xu	An improved approximation algorithm for uncapacitated facility location problem with penalties.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Algorithms, Approximation algorithms, Outliers, Facility location problem
3	Zhenbo Wang, Wenxun Xing	A successive approximation algorithm for the multiple knapsack problem.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Approximation algorithm, Worst-case analysis, Multiple knapsack problem
3	Bodo Manthey, L. Shankar Ram	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
3	Xujin Chen, Bo Chen	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
3	Zhi-Zhong Chen, Lusheng Wang, Zhanyong Wang	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.	Algorithmica	2009	DBLP DOI BibTeX RDF	Duplication models, Approximation algorithms, Tandem repeats
3	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
3	Jan Remy, Angelika Steger	Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Computational geometry, Approximation schemes, Steiner tree problem
3	Lu-Chuan Ceng, Qamrul Hasan Ansari, Jen-Chih Yao	Viscosity approximation methods for generalized equilibrium problems and fixed point problems.	J. Global Optimization	2009	DBLP DOI BibTeX RDF	Viscosity approximation method, Generalized equilibrium problem, Nonexpansive mappings, Strong convergence, Fixed points
3	Feilong Cao, Yongquan Zhang, Zongben Xu	Lower estimation of approximation rate for neural networks.	Science in China Series F: Information Sciences	2009	DBLP DOI BibTeX RDF	topology structure of hidden layer, lower, approximation, feedforward neural networks, rate
3	Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia	On truthfulness and approximation for scheduling selfish tasks.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Scheduling, Approximation algorithms, Game theory, Truthfulness
3	Glencora Borradaile, Philip N. Klein, Claire Mathieu	An O(n log n) approximation scheme for Steiner tree in planar graphs.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	planar graphs, Steiner tree, approximation scheme
3	Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov	A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Approximation algorithms, graphs, connectivity
3	Guojun Li, Xiaotie Deng, Ying Xu	A polynomial-time approximation scheme for embedding hypergraph in a cycle.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Hypergraph embedding, minimum congestion, NP-hard, polynomial-time approximation scheme
3	Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas	Linear time 3-approximation for the MAST problem.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree
3	Anna Gomolinska	Rough Approximation Based on Weak q-RIFs.	T. Rough Sets	2009	DBLP DOI BibTeX RDF	weak quasi-rough inclusion, rough approximation space, rough inclusion
3	Zhuo-hua Peng, Jin-wang Liu	The generalized bisymmetric solutions of the matrix equation A 1 X 1 B 1 + A 2 X 2 B 2 + + A l X l B l = C and its optimal approximation.	Numerical Algorithms	2009	DBLP DOI BibTeX RDF	Generalized bisymmetric solution group, Least-norm solution group, Optimal approximation solution group, Iterative method
3	Thi Huyen Chau Nguyen, Pascal Richard, Enrico Bini	Approximation techniques for response-time analysis of static-priority tasks.	Real-Time Systems	2009	DBLP DOI BibTeX RDF	Uniprocessor real-time scheduling, Static-priority tasks, Approximation scheme, Worst-case response time
3	Jan Remy, Angelika Steger	A quasi-polynomial time approximation scheme for minimum weight triangulation.	J. ACM	2009	DBLP DOI BibTeX RDF	approximation algorithms, Minimum weight triangulation
3	Roman V. Efremov, Georgy K. Kamenev	Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems.	Annals OR	2009	DBLP DOI BibTeX RDF	Polyhedral approximation, Estimation refinement method, Feasible goals method, Multicriteria optimization
3	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
3	Zhi-Zhong Chen, Lusheng Wang	Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats.	IEEE/ACM Trans. Comput. Biology Bioinform.	2009	DBLP DOI BibTeX RDF	approximation algorithms, Computational biology
3	Xin Chen, Yun Cui	An Approximation Algorithm for the Minimum Breakpoint Linearization Problem.	IEEE/ACM Trans. Comput. Biology Bioinform.	2009	DBLP DOI BibTeX RDF	partially ordered genomes, breakpoint distance, approximation algorithms, Comparative genomics
3	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
3	S. Leyffer	Generalized Outer Approximation.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Branch and bound, Mixed integer nonlinear programming, Outer approximation
3	Ravi Tiwari, Thang N. Dinh, My T. Thai	On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks.	WASA	2009	DBLP DOI BibTeX RDF	Interference-aware, Approximation Algorithm, Broadcast Scheduling
3	Qinghua Zhu, Deying Li	An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks.	WASA	2009	DBLP DOI BibTeX RDF	Conflict-aware, many-to-one data aggregation, wireless sensor network, approximation algorithm, latency
3	Hong Chen, Li Kong	Integrated Radial Basis Function Networks with Adaptive Residual Subsampling Training Method for Approximation and Solving PDEs.	ISNN	2009	DBLP DOI BibTeX RDF	Approximation, Radial basis functions, Partial differential equation, Collocation
3	Shiyan Hu, Zhuo Li, Charles J. Alpert	A faster approximation scheme for timing driven minimum cost layer assignment.	ISPD	2009	DBLP DOI BibTeX RDF	dynamic programming, np-complete, oracle, fully polynomial time approximation scheme, layer assignment
3	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
3	Timothy M. Chan, Sariel Har-Peled	Approximation algorithms for maximum independent set of pseudo-disks.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation., local search
3	Chi Shen, Mike Unuakhalu	A class of multistep sparse matrix strategies for concept decomposition matrix approximation.	SAC	2009	DBLP DOI BibTeX RDF	concept decomposition matrix, multistep, sparse matrix approximation, term-document matrix, least-squares
3	Shiyan Hu, Zhuo Li, Charles J. Alpert	A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion.	DAC	2009	DBLP DOI BibTeX RDF	dynamic programming, NP-complete, buffer insertion, fully polynomial time approximation scheme, cost minimization
3	Yuichi Nakamura, Masahiro Nakagawa	Approximation Capability of Continuous Time Recurrent Neural Networks for Non-autonomous Dynamical Systems.	ICANN	2009	DBLP DOI BibTeX RDF	Continuous Time Recurrent Neural Network, Non-autonomous, Approximation, Dynamical system, Capability
3	Jae Hee Han, Myung Hoon Sunwoo	Simplified sum-product algorithm using piecewise linear function approximation for low complexity LDPC decoding.	ICUIMC	2009	DBLP DOI BibTeX RDF	forword error correction, piecewise linear function approximation, sum-product algorithm, iterative decoding, LDPC