The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for approximation with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1956-1960 (18) 1961-1964 (18) 1965-1966 (16) 1967 (19) 1968 (15) 1969 (22) 1970 (21) 1971 (17) 1972 (22) 1973 (21) 1974 (23) 1975 (28) 1976 (25) 1977 (25) 1978 (19) 1979 (20) 1980 (24) 1981 (27) 1982 (34) 1983 (46) 1984 (47) 1985 (51) 1986 (63) 1987 (61) 1988 (95) 1989 (96) 1990 (133) 1991 (146) 1992 (174) 1993 (265) 1994 (295) 1995 (372) 1996 (334) 1997 (474) 1998 (557) 1999 (621) 2000 (765) 2001 (967) 2002 (1124) 2003 (1279) 2004 (1688) 2005 (1996) 2006 (2276) 2007 (2517) 2008 (2461) 2009 (2069) 2010 (1291) 2011 (1248) 2012 (1232) 2013 (1287) 2014 (1310) 2015 (1396) 2016 (1309) 2017 (1317) 2018 (1500) 2019 (931)
Publication types (Num. hits)
article(17079) book(47) incollection(315) inproceedings(16515) phdthesis(198) proceedings(53)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15492 occurrences of 5288 keywords

Results
Found 34207 publication records. Showing 34207 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
53Vladimir N. Temlyakov Nonlinear Methods of Approximation. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Classification. 41A17, 41A46, 41A65, 42A10, 46A35, 46C99, 46N40, 65J05, 41A25, 42C15, 65D15, 42C10, 46E35
53Jan G. Bazan, Andrzej Skowron, Roman W. Swiniarski Rough Sets and Vague Concept Approximation: From Sample Approximation to Adaptive Learning. Search on Bibsonomy Trans. Rough Sets The full citation details ... 2006 DBLP  DOI  BibTeX  RDF higher order vagueness, rough sets, constraints, reinforcement learning, intelligent systems, incremental learning, adaptive learning, Vagueness, approximation space
48Richard G. Baraniuk, Ronald A. DeVore, George Kyriazis, X. M. Yu Near Best Tree Approximation. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF n-term approximation, approximation classes, compression, encoding
45Guy Kortsarz, Zeev Nutov Approximating Node Connectivity Problems via Set Covers. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Vertex connected spanning subgraph, Metric costs, Approximation algorithms
44Sanjiv Kapoor, Mohammad Sarwat Bounded-Diameter Minimum-Cost Graph Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
44Wei-Zhi Wu, Yee Leung, Wen-Xiu Zhang On Generalized Rough Fuzzy Approximation Operators. Search on Bibsonomy Trans. Rough Sets The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fuzzy topological spaces, rough sets, fuzzy sets, belief functions, binary relations, approximation operators, neighborhood systems, rough fuzzy sets
43Jérôme Monnot, Sophie Toulouse Approximation Results for the Weighted P4 Partition Problems. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF 3-length chain, standard approximation, differential approximation, approximation algorithms, Graph partition, performance ratio
41Zheng Fang, Jie Wang 0002 Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem. Search on Bibsonomy WASA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF point coverage, minimum set multicover, approximation algorithm, sensor deployment, LP-rounding
40Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko Tight approximation algorithms for maximum general assignment problems. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Guy Kortsarz, Zeev Nutov Approximating node connectivity problems via set covers. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
40Tong-Jun Li Rough Approximation Operators in Covering Approximation Spaces. Search on Bibsonomy RSCTC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF rough sets, partitions, coverings, Approximation operators
40Moses Charikar, Balaji Raghavachari The Finite Capacity Dial-A-Ride Problem. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF dial-a-ride, stacker crane, probabilistic approximation of metric spaces, algorithm, routing, approximation, capacity, vehicle, delivery, tree metric
39Lashon B. Booker Adaptive value function approximations in classifier systems. Search on Bibsonomy GECCO Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF hyperplane coding, tile coding, reinforcement learning, learning classifier systems, function approximation
39Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster Approximation algorithms and hardness results for cycle packing problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
39Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap Pseudo approximation algorithms, with applications to optimal motion planning. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 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
38Karl Bringmann, Tobias Friedrich 0001 The maximum hypervolume set yields near-optimal approximation. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation, performance measures, multiobjective optimization, hypervolume indicator
38Nam H. Nguyen, Thong T. Do, Trac D. Tran A fast and efficient algorithm for low-rank approximation of a matrix. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF low rank matrix approximation, noncommutative khintchine inequality, structurally random matrix, singular value decomposition
38Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb Private approximation of search problems. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF private approximation, solution-list algorithm, vertex cover, secure computation
38Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
38Ashkan Aazami, Michael D. Stilp Approximation Algorithms and Hardness for Domination with Propagation. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS
37Piotr Wasilewski Concept Lattices vs. Approximation Spaces. Search on Bibsonomy RSFDGrC (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Scot Anderson, Peter Z. Revesz Verifying the Incorrectness of Programs and Automata. Search on Bibsonomy SARA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36William Zhu, Fei-Yue Wang Binary Relation Based Rough Sets. Search on Bibsonomy FSKD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Rough set, Fuzzy set, Granular computing, Binary relation, Upper approximation, Lower approximation
36Jianmin Ma, Wen-Xiu Zhang, Wei-Zhi Wu, Tong-Jun Li Granular Computing Based on a Generalized Approximation Space. Search on Bibsonomy RSKT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Generalized approximation space, L??lower approximation operator, H??upper approximation operator, Similarity relation
36Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov Best Basis Selection for Approximation in Lp. Search on Bibsonomy Foundations of Computational Mathematics The full citation details ... 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
36Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ad hoc networks, approximation algorithms, topology control, graph model, power conservation, graph properties
36Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi Minimum-power multicast routing in static ad hoc wireless networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximation algorithms, power control, multicast routing
36Moses Charikar, Sudipto Guha Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF linear programming, approximation, local search, facility location, combinatorial algorithms, k-median
36Guy Kortsarz, Zeev Nutov Approximating Some Network Design Problems with Node Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
36Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. Search on Bibsonomy ICCSA (3) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem
35Erik D. Demaine, Nicole Immorlica Correlation Clustering with Partial Information. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Rahul Garg, Vijay Kumar, Vinayaka Pandit Approximation Algorithms for Budget-Constrained Auctions. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF approximation algorithm, auctions, rounding, winner determination
35Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee Improved approximation algorithms for minimum-weight vertex separators. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
35Nikhil Bansal, Avrim Blum, Shuchi Chawla 0001, Adam Meyerson Approximation algorithms for deadline-TSP and vehicle routing with time-windows. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximation algorithms, traveling salesman problem, orienteering, vehicle routing
35Anupam Gupta, Amit Kumar 0001, Tim Roughgarden Simpler and better approximation algorithms for network design. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF approximation algorithms, randomized algorithms, network design
35Sanjeev Arora Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation algorithms, matching, traveling salesman problem, network design, Steiner problem
35Walter Unger The Complexity of the Approximation of the Bandwidth Problem. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF comlexity, approximation, bandwidth
35Anand Srivastav, Katja Wolf Finding Dense Subgraphs with Semidefinite Programming. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming
35Reuven Bar-Yehuda One for the Price of Two: A Unified Approach for Approximating Covering Problems. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
35Mohammad Mahdian, Yingyu Ye, Jiawei Zhang A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang 0001 Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Shiro Matuura, Tomomi Matsui 63-Approximation Algorithm for MAX DICUT. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Eran Halperin, Robert Krauthgamer Polylogarithmic inapproximability. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF integrality ratio, polylogarithmic approximation, approximation algorithms, Steiner tree, hardness of approximation
34Zeev Nutov An almost O(log k)-approximation for k-connected subgraphs. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
34Adrian Kosowski Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. Search on Bibsonomy SIROCCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Andrzej Skowron, Roman W. Swiniarski, Piotr Synak Approximation Spaces and Information Granulation. Search on Bibsonomy Trans. Rough Sets The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Sriram V. Pemmaraju, Rajiv Raman Approximation Algorithms for the Max-coloring Problem. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Andrzej Skowron, Roman W. Swiniarski, Piotr Synak Approximation Spaces and Information Granulation. Search on Bibsonomy Rough Sets and Current Trends in Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Stavros G. Kolliopoulos, Clifford Stein Improved Approximation Algorithms for Unsplittable Flow Problems. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Patricia A. Evans, Andrew D. Smith Complexity of Approximating Closest Substring Problems. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Closest Substring, Approximation algorithms, Hardness of approximation
33Edgar 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]. Search on Bibsonomy IEEE Trans. Neural Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Chandra Chekuri, Sanjeev Khanna Edge-disjoint paths revisited. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
32Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Search on Bibsonomy MobiCom The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ad hoc network, approximation algorithm, topology control, graph model, power conservation, graph property
32Hengwu Li Approximation algorithm and scheme for RNA structure prediction. Search on Bibsonomy Int. Conf. Interaction Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithm, approximation scheme, RNA structure, pseudoknot
32Jianping Li, Weidong Li 0002, Jianbo Li Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service
32Joseph Cheriyan, Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems
32Wang Baocang, Yupu Hu Diophantine Approximation Attack on a Fast Public Key Cryptosystem. Search on Bibsonomy ISPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Simultaneous Diophantine approximation problem, Cryptanalysis, Public-key cryptosystem, Lattice basis reduction, Diophantine approximation
32Alantha Newman The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
32Thomas Hofmeister, Martin Hühne Semidefinite Programming and Its Applications to Approximation Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
32Dong Qiu, Lan Shu Rough Sets of System. Search on Bibsonomy ICFIE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF lower system approximation, upper system approximation, Rough sets, system, upper approximation, lower approximation
32Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko Approximating Minimum-Power Degree and Connectivity Problems. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Bodo Manthey, L. Shankar Ram Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
32Minkyoung Cho, David M. Mount Improved Approximation Bounds for Planar Point Pattern Matching. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithms, Hausdorff distance, Point pattern matching
32Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas Approximation Algorithms for 3D Orthogonal Knapsack. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF geometric configurations, approximation algorithm, computational and structural complexity
32Jaroslaw Stepaniuk Approximation Spaces in Multi Relational Knowledge Discovery. Search on Bibsonomy Trans. Rough Sets The full citation details ... 2007 DBLP  DOI  BibTeX  RDF uncertainty function, rough sets, approximation spaces, rough inclusion, multi-relational data mining
32Tongjun Li, Jianmin Ma Fuzzy Approximation Operators Based on Coverings. Search on Bibsonomy RSFDGrC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Crisp coverings, fuzzy coverings, fuzzy-covering-based fuzzy rough approximation operators, fuzzy sets, fuzzy partitions
32Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett Playing games with approximation algorithms. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF online linear optimization, approximation algorithms, regret minimization
32Maciej Borkowski, James F. Peters Matching 2D Image Segments with Genetic Algorithms and Approximation Spaces. Search on Bibsonomy Trans. Rough Sets The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 2D matching, genetic algorithm, image segment, rough sets, coverage, image, Approximation space
32Raja Jothi, Balaji Raghavachari Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation algorithms, network design, Spanning trees, minimum spanning trees
32Lan Liu 0001, Xi Chen 0001, Jing Xiao, Tao Jiang 0001 Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF L-reduction, positive result, negative result, bounded number, mates, complexity, approximation, children, SNP, recombinant, Haplotyping, pedigree
32Patrick Briest, Piotr Krysta, Berthold Vöcking Approximation techniques for utilitarian mechanism design. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF combinatorial and multi-unit auctions, enumeration techniques, approximation algorithms, mechanism design, primal-dual method
32Rajiv Gandhi, Samir Khuller, Aravind Srinivasan Approximation Algorithms for Partial Covering Problems. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
32Ryuhei Uehara, Zhi-Zhong Chen Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF parallel algorithm, approximation algorithm, Graph algorithm, maximum weighted matching
32Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. Search on Bibsonomy ESA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization
32David Cubanski, David Cyganski Multivariate Classification through Adaptive Delaunay-Based C0 Spline Approximation. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF neural networks, approximation, Pattern classification, ECG, splines, non-linear optimization
31Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi Some Approximation Results for the Maximum Agreement Forest Problem. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
31Guy 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. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
31Xiaoqun Wang On the approximation error in high dimensional model representation. Search on Bibsonomy Winter Simulation Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Yossi Azar, Amir Epstein The Hardness of Network Design for Unsplittable Flow with Selfish Users. Search on Bibsonomy WAOA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Guy Kortsarz, Zeev Nutov Approximation algorithm for k-node connected subgraphs via critical graphs. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
31Guy Even, Guy Kortsarz An approximation algorithm for the group Steiner problem. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
31Eran Halperin, Aravind Srinivasan Improved Approximation Algorithms for the Partial Vertex Cover Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
30Wei-Lin Li, Peng Zhang 0008, Daming Zhu On Constrained Facility Location Problems. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation hardness, approximation algorithm, local search, Facility Location
30Han-Saem Yun, Jihong Kim On energy-optimal voltage scheduling for fixed-priority hard real-time systems. Search on Bibsonomy ACM Trans. Embedded Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF real-time systems, approximation algorithms, dynamic voltage scaling, Fixed-priority scheduling, fully polynomial time approximation scheme, variable voltage processor
30Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin Approximating a Finite Metric by a Small Number of Tree Metrics. Search on Bibsonomy FOCS The full citation details ... 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
30Chi-hsin Wu, Peter C. Doerschuk Application of the cluster approximation for the simultaneous restoration and segmentation of tomographic images. Search on Bibsonomy ICIP The full citation details ... 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
30Mauro Barni, Franco Bartolini, Fabio Buti, Vito Cappellini Optimum linear approximation of the Euclidean norm to speed up vector median filtering. Search on Bibsonomy ICIP The full citation details ... 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
30Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
30Panagiotis Panagi, Marios M. Polycarpou Decentralized adaptive approximation based control with safety scheme outside the approximation region. Search on Bibsonomy CDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Adi Avidor, Ido Berkovitch, Uri Zwick Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. Search on Bibsonomy WAOA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Gustav Hast Beating a Random Assignment. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Yana Kortsarts, Guy Kortsarz, Zeev Nutov Approximation Algorithm for Directed Multicuts. Search on Bibsonomy WAOA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Gustav Hast Approximating Max kCSP Using Random Restrictions. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar 0001 Approximation Algorithms for the Unsplittable Flow Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott 0001 Improved approximations for multiprocessor scheduling under uncertainty. Search on Bibsonomy SPAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF scheduling under uncertainty, approximation algorithms, multiprocessor scheduling, stochastic scheduling
29William Zhu, Fei-Yue Wang On Three Types of Covering-Based Rough Sets. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF data mining, Rough sets, approximation, fuzzy sets, reduct, granular computing, covering, computing with words
29Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, stochastic optimization, cost sharing
29Guy Even, Guy Kortsarz, Wolfgang Slany On network design problems: fixed cost flows and the covering steiner problem. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Optimization, approximation, graphs, theory, flow
29Andrzej Skowron, Jaroslaw Stepaniuk, Roman W. Swiniarski Approximation Spaces in Machine Learning and Pattern Recognition. Search on Bibsonomy PReMI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Rough sets, approximation spaces, concept approximation
29Tuan Trung Nguyen, Andrzej Skowron Rough Set Approach to Domain Knowledge Approximation. Search on Bibsonomy RSFDGrC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF domain knowledge approximation, machine learning, Rough mereology, handwritten digit recognition, concept approximation
Displaying result #1 - #100 of 34207 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license