Search results for "Approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
30	Hadas Shachnai, Tami Tamir	Polynomial-Time Approximation Schemes.	Handbook of Approximation Algorithms and Metaheuristics	2007	DBLP DOI BibTeX RDF
30	Foto N. Afrati	On Approximation Algorithms for Data Mining Applications.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Stefano Leonardi 0001	A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Thomas Erlebach	Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano	Approximation Algorithms for Path Coloring in Trees.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Eric Angel	A Survey of Approximation Results for Local Search Algorithms.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Klaus Jansen	Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Roberto Solis-Oba	Approximation Algorithms for the k-Median Problem.	Efficient Approximation and Online Algorithms	2006	DBLP DOI BibTeX RDF
30	Martin E. Dyer, Mark Jerrum, Marek Karpinski	05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms.	Design and Analysis of Randomized and Approximation Algorithms	2005	DBLP BibTeX RDF
30	Richard Mayr, Annette Schelten	Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
30	Elliot Ward Cheney	Ill-posed Problems in multivariate Approximation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
30	Richard Franke, Larry L. Schumaker	A Bibliography of multivariate Approximation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
30	João B. Prolla	Approximation by positive Elements of subalgebras of Real-Valued Functions.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
30	Richard Franke	Recent Advances in the Approximation of surfaces from scattered Data.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
30	Günter Baszenski, Franz-Jürgen Delvos	Boolean Methods in Fourier Approximation.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
30	Werner Haußmann	Approximation by harmonic Functions.	Topics in Multivariate Approximation	1987	DBLP DOI BibTeX RDF
30	Zeev Nutov	An almost O(log k)-approximation for k-connected subgraphs.	SODA	2009	DBLP DOI BibTeX RDF
30	Adrian Kosowski	Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.	SIROCCO	2006	DBLP DOI BibTeX RDF
30	Andrzej Skowron, Roman W. Swiniarski, Piotr Synak	Approximation Spaces and Information Granulation.	Trans. Rough Sets	2005	DBLP DOI BibTeX RDF
30	Sriram V. Pemmaraju, Rajiv Raman 0001	Approximation Algorithms for the Max-coloring Problem.	ICALP	2005	DBLP DOI BibTeX RDF
30	Andrzej Skowron, Roman W. Swiniarski, Piotr Synak	Approximation Spaces and Information Granulation.	Rough Sets and Current Trends in Computing	2004	DBLP DOI BibTeX RDF
30	Stavros G. Kolliopoulos, Clifford Stein 0001	Improved Approximation Algorithms for Unsplittable Flow Problems.	FOCS	1997	DBLP DOI BibTeX RDF
30	Edgar N. Sánchez, Alma Y. Alanis	Adaptive Approximation Based Control: Unifying Neural, Fuzzy and Traditional Adaptive Approximation Approaches (Farrell, J.A. and Polycarpou, M.M. [Book review].	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
30	Alantha Newman	The Maximum Acyclic Subgraph Problem and Degree-3 Graphs.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
30	Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi	Some Approximation Results for the Maximum Agreement Forest Problem.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
30	Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov	A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
30	Mauro Barni, Franco Bartolini, Fabio Buti, Vito Cappellini	Optimum linear approximation of the Euclidean norm to speed up vector median filtering.	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
30	Chi-hsin Wu, Peter C. Doerschuk	Application of the cluster approximation for the simultaneous restoration and segmentation of tomographic images.	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
29	Chandra Chekuri, Sanjeev Khanna	Edge-disjoint paths revisited.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
29	Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni	Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.	MobiCom	2003	DBLP DOI BibTeX RDF	ad hoc network, approximation algorithm, topology control, graph model, power conservation, graph property
29	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
29	Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas	Approximation Algorithms for 3D Orthogonal Knapsack.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	geometric configurations, approximation algorithm, computational and structural complexity
29	Minkyoung Cho, David M. Mount	Improved Approximation Bounds for Planar Point Pattern Matching.	Algorithmica	2008	DBLP DOI BibTeX RDF	Approximation algorithms, Hausdorff distance, Point pattern matching
29	Jaroslaw Stepaniuk	Approximation Spaces in Multi Relational Knowledge Discovery.	Trans. Rough Sets	2007	DBLP DOI BibTeX RDF	uncertainty function, rough sets, approximation spaces, rough inclusion, multi-relational data mining
29	Tongjun Li, Jianmin Ma	Fuzzy Approximation Operators Based on Coverings.	RSFDGrC	2007	DBLP DOI BibTeX RDF	Crisp coverings, fuzzy coverings, fuzzy-covering-based fuzzy rough approximation operators, fuzzy sets, fuzzy partitions
29	Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett	Playing games with approximation algorithms.	STOC	2007	DBLP DOI BibTeX RDF	online linear optimization, approximation algorithms, regret minimization
29	Maciej Borkowski, James F. Peters	Matching 2D Image Segments with Genetic Algorithms and Approximation Spaces.	Trans. Rough Sets	2006	DBLP DOI BibTeX RDF	2D matching, genetic algorithm, image segment, rough sets, coverage, image, Approximation space
29	Raja Jothi, Balaji Raghavachari	Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, network design, Spanning trees, minimum spanning trees
29	Lan Liu 0001, Xi Chen 0001, Jing Xiao, Tao Jiang 0001	Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem.	ISAAC	2005	DBLP DOI BibTeX RDF	L-reduction, positive result, negative result, bounded number, mates, complexity, approximation, children, SNP, recombinant, Haplotyping, pedigree
29	Patrick Briest, Piotr Krysta, Berthold Vöcking	Approximation techniques for utilitarian mechanism design.	STOC	2005	DBLP DOI BibTeX RDF	combinatorial and multi-unit auctions, enumeration techniques, approximation algorithms, mechanism design, primal-dual method
29	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan	Approximation Algorithms for Partial Covering Problems.	ICALP	2001	DBLP DOI BibTeX RDF	Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
29	Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti	Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.	ESA	2000	DBLP DOI BibTeX RDF	Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization
29	Ryuhei Uehara, Zhi-Zhong Chen	Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.	IFIP TCS	2000	DBLP DOI BibTeX RDF	parallel algorithm, approximation algorithm, Graph algorithm, maximum weighted matching
29	David Cubanski, David Cyganski	Multivariate Classification through Adaptive Delaunay-Based C0 Spline Approximation.	IEEE Trans. Pattern Anal. Mach. Intell.	1995	DBLP DOI BibTeX RDF	neural networks, approximation, Pattern classification, ECG, splines, non-linear optimization
29	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
28	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
28	Wei-Lin Li, Peng Zhang 0008, Daming Zhu	On Constrained Facility Location Problems.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	approximation hardness, approximation algorithm, local search, Facility Location
28	Han-Saem Yun, Jihong Kim 0001	On energy-optimal voltage scheduling for fixed-priority hard real-time systems.	ACM Trans. Embed. Comput. Syst.	2003	DBLP DOI BibTeX RDF	real-time systems, approximation algorithms, dynamic voltage scaling, Fixed-priority scheduling, fully polynomial time approximation scheme, variable voltage processor
28	Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin	Approximating a Finite Metric by a Small Number of Tree Metrics.	FOCS	1998	DBLP DOI BibTeX RDF	probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric
28	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
28	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
28	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
28	Vera Kurková, Marcello Sanguineti	Comparison of Rates of Linear and Neural Network Approximation.	IJCNN (1)	2000	DBLP DOI BibTeX RDF	linear and neural network approximation, Kolmogorov width, dimension-independent rates of approximation, perceptron networks
28	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
28	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
28	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
28	Hsueh-I Lu, R. Ravi 0001	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
28	Takuro Kida	The extended optimum interpolatory approximation of multi-dimensional signals.	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)
28	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
27	Ingo Wegener	Randomized Search Heuristics as an Alternative to Exact Optimization.	Logic versus Approximation	2004	DBLP DOI BibTeX RDF
27	Walter Oberschelp	Discrete and Continuous Methods of Demography.	Logic versus Approximation	2004	DBLP DOI BibTeX RDF
27	Britta Schinzel	Computer Science between Symbolic Representation and Open Construction.	Logic versus Approximation	2004	DBLP DOI BibTeX RDF
27	Katja Wolf	Dense Instances of Hard Optimization Problems.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
27	Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko	Approximating Minimum-Power Degree and Connectivity Problems.	LATIN	2008	DBLP DOI BibTeX RDF
27	Xiaoqun Wang	On the approximation error in high dimensional model representation.	WSC	2008	DBLP DOI BibTeX RDF
27	Yossi Azar, Amir Epstein	The Hardness of Network Design for Unsplittable Flow with Selfish Users.	WAOA	2005	DBLP DOI BibTeX RDF
27	Guy Kortsarz, Zeev Nutov	Approximation algorithm for k-node connected subgraphs via critical graphs.	STOC	2004	DBLP DOI BibTeX RDF
27	Guy Even, Guy Kortsarz	An approximation algorithm for the group Steiner problem.	SODA	2002	DBLP BibTeX RDF
27	Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan	Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
27	Panagiotis Panagi, Marios M. Polycarpou	Decentralized adaptive approximation based control with safety scheme outside the approximation region.	CDC	2008	DBLP DOI BibTeX RDF
27	Adi Avidor, Ido Berkovitch, Uri Zwick	Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT.	WAOA	2005	DBLP DOI BibTeX RDF
27	Gustav Hast	Beating a Random Assignment.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
27	Yana Kortsarts, Guy Kortsarz, Zeev Nutov	Approximation Algorithm for Directed Multicuts.	WAOA	2004	DBLP DOI BibTeX RDF
27	Gustav Hast	Approximating Max kCSP Using Random Restrictions.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
27	Amit Chakrabarti, Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001	Approximation Algorithms for the Unsplittable Flow Problem.	APPROX	2002	DBLP DOI BibTeX RDF
27	Michael Langberg, Yuval Rabani, Chaitanya Swamy	Approximation Algorithms for Graph Homomorphism Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
27	Hadas Shachnai, Tami Tamir	Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
27	Alberto Caprara, Hans Kellerer, Ulrich Pferschy	Approximation Schemes for Ordered Vector Packing Problems.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
27	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
26	Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott 0001	Improved approximations for multiprocessor scheduling under uncertainty.	SPAA	2008	DBLP DOI BibTeX RDF	scheduling under uncertainty, approximation algorithms, multiprocessor scheduling, stochastic scheduling
26	William Zhu 0001, Fei-Yue Wang 0001	On Three Types of Covering-Based Rough Sets.	IEEE Trans. Knowl. Data Eng.	2007	DBLP DOI BibTeX RDF	data mining, Rough sets, approximation, fuzzy sets, reduct, granular computing, covering, computing with words
26	Lisa Fleischer, Jochen Könemann, Stefano Leonardi 0001, Guido Schäfer	Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.	STOC	2006	DBLP DOI BibTeX RDF	approximation algorithms, stochastic optimization, cost sharing
26	Guy Even, Guy Kortsarz, Wolfgang Slany	On network design problems: fixed cost flows and the covering steiner problem.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	Optimization, approximation, graphs, theory, flow
26	Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui	An Improved Approximation Algorithm for the Traveling Tournament Problem.	ISAAC	2009	DBLP DOI BibTeX RDF	traveling tournament problem, scheduling, approximation algorithm, lower bound, timetabling
26	Chayant Tantipathananandh, Tanya Y. Berger-Wolf	Constant-factor approximation algorithms for identifying dynamic communities.	KDD	2009	DBLP DOI BibTeX RDF	approximation algorithms, community identification, dynamic social networks
26	Jan Drugowitsch, Alwyn Barry	A formal framework and extensions for function approximation in learning classifier systems.	Mach. Learn.	2008	DBLP DOI BibTeX RDF	Kalman filter, Learning classifier systems, Function approximation
26	Zoltán Király	Better and Simpler Approximation Algorithms for the Stable Marriage Problem.	ESA	2008	DBLP DOI BibTeX RDF	Hospitals/Residents problem, approximation algorithms, stable matching
26	Paul S. Bonsma, Florian Zickfeld	A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.	WG	2008	DBLP DOI BibTeX RDF	maximum leaf, approximation algorithm, connected dominating set, cubic graph
26	Xiaofeng Gao 0001, Yaochun Huang, Zhao Zhang 0002, Weili Wu 0001	(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.	COCOON	2008	DBLP DOI BibTeX RDF	Approximation algorithm, Dominating Set, Unit Disk Graph
26	Omid Amini, Stéphane Pérennes, Ignasi Sau	Hardness and Approximation of Traffic Grooming.	ISAAC	2007	DBLP DOI BibTeX RDF	SONET ADM, Approximation Algorithms, Optical Networks, PTAS, inapproximability, Traffic Grooming, APX-hardness
26	Sebastian Widz, Dominik Slezak	Approximation Degrees in Decision Reduct-Based MRI Segmentation.	FBIT	2007	DBLP DOI BibTeX RDF	Approximation Degrees, Rough Sets, MRI Segmentation, Partial Volume Effect, Decision Reducts
26	Guolong Lin, Rajmohan Rajaraman	Approximation algorithms for multiprocessor scheduling under uncertainty.	SPAA	2007	DBLP DOI BibTeX RDF	approximation algorithms, multiprocessor scheduling
26	Dorit S. Hochbaum, Asaf Levin	Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs.	WAOA	2007	DBLP DOI BibTeX RDF	Approximation algorithms, network design, set cover
26	Zongben Xu, Jianjun Wang 0003	The essential order of approximation for nearly exponential type neural networks.	Sci. China Ser. F Inf. Sci.	2006	DBLP DOI BibTeX RDF	nearly exponential type neural networks, the essential order of approximation, the modulus of smoothness of a multivariate function
26	Maria-Florina Balcan, Avrim Blum	Approximation algorithms and online mechanisms for item pricing.	EC	2006	DBLP DOI BibTeX RDF	single minded, unlimited supply, approximation algorithms, combinatorial auctions, online optimization
26	José-Alejandro Piñeiro, Stuart F. Oberman, Jean-Michel Muller, Javier D. Bruguera	High-Speed Function Approximation Using a Minimax Quadratic Interpolator.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Table-based methods, minimax polynomial approximation, single-precision computations, computer arithmetic, square root, reciprocal, elementary functions
26	Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko	Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.	J. ACM	2005	DBLP DOI BibTeX RDF	Approximation algorithms
26	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.	ESA	2005	DBLP DOI BibTeX RDF	min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
26	Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough	A Faster and Simpler 2-Approximation Algorithm for Block Sorting.	FCT	2005	DBLP DOI BibTeX RDF	approximation algori- thms, block sorting, transposition sorting, optical character recognition, Design and analysis of algorithms
26	Joseph Cheriyan, Adrian Vetta	Approximation algorithms for network design with metric costs.	STOC	2005	DBLP DOI BibTeX RDF	metric costs, approximation algorithms, graph connectivity