The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase 3-approximation (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1956-1959 (16) 1960-1961 (15) 1962-1964 (15) 1965-1966 (17) 1967 (19) 1968 (16) 1969 (22) 1970 (22) 1971 (18) 1972 (23) 1973 (22) 1974 (25) 1975 (31) 1976 (29) 1977 (26) 1978 (20) 1979 (24) 1980 (25) 1981 (27) 1982 (34) 1983 (47) 1984 (48) 1985 (52) 1986 (66) 1987 (93) 1988 (105) 1989 (98) 1990 (142) 1991 (163) 1992 (192) 1993 (279) 1994 (311) 1995 (384) 1996 (357) 1997 (500) 1998 (578) 1999 (638) 2000 (799) 2001 (924) 2002 (1075) 2003 (1240) 2004 (1651) 2005 (1951) 2006 (2231) 2007 (2461) 2008 (2431) 2009 (1982) 2010 (1213) 2011 (1185) 2012 (1181) 2013 (1236) 2014 (1260) 2015 (1324) 2016 (1277) 2017 (1305) 2018 (1604) 2019 (1744) 2020 (1892) 2021 (1826) 2022 (1925) 2023 (1974) 2024 (491)
Publication types (Num. hits)
article(22198) book(60) data(2) incollection(452) inproceedings(19535) phdthesis(369) proceedings(65)
Venues (Conferences, Journals, ...)
CoRR(4553) APPROX-RANDOM(983) SODA(556) Appl. Math. Comput.(441) WAOA(441) STOC(355) J. Approx. Theory(331) Algorithmica(324) FOCS(323) CDC(311) J. Comput. Appl. Math.(305) Theor. Comput. Sci.(281) IEEE Trans. Signal Process.(269) ICASSP(261) ESA(259) SIAM J. Numer. Anal.(247) More (+10 of total 3604)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15492 occurrences of 5288 keywords

Results
Found 42681 publication records. Showing 42681 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
48Jan 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
47Vladimir N. Temlyakov Nonlinear Methods of Approximation. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Classification. 41A17, 41A46, 41A65, 42A10, 46A35, 46C99, 46N40, 65J05, 41A25, 42C15, 65D15, 42C10, 46E35
44Richard 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
40Jé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
40Guy 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
40Wei-Zhi Wu 0001, 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
38Thomas 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
38Sanjiv Kapoor, Mohammad Sarwat Bounded-Diameter Minimum-Cost Graph Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Zheng Fang 0004, 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
37Tong-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
36Moses 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
36Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, 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
36Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap Pseudo approximation algorithms, with applications to optimal motion planning. Search on Bibsonomy SCG 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
36Omid 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
36Ashkan 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
36Armin Stahl Approximation of Utility Functions by Learning Similarity Measures. Search on Bibsonomy Logic versus Approximation The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
36Lisa 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
36Guy Kortsarz, Zeev Nutov Approximating node connectivity problems via set covers. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Jianmin Ma, Wen-Xiu Zhang, Wei-Zhi Wu 0001, 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
35Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov Best Basis Selection for Approximation in Lp. Search on Bibsonomy Found. Comput. Math. 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
34Lashon 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
34Karl 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
34Nam 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
34Amos 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
34Rahul Garg 0001, 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
33William Zhu 0001, Fei-Yue Wang 0001 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
33Guy 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
33Yen 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
33Detlef Sieling Derandomization. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Michael M. Richter Logic and Approximation in Knowledge Based Systems. Search on Bibsonomy Logic versus Approximation The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Thomas Jansen 0001 Introduction to the Theory of Complexity and Approximation Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Piotr Wasilewski Concept Lattices vs. Approximation Spaces. Search on Bibsonomy RSFDGrC (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Scot Anderson, Peter Z. Revesz Verifying the Incorrectness of Programs and Automata. Search on Bibsonomy SARA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Erik D. Demaine, Nicole Immorlica Correlation Clustering with Partial Information. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33Rajiv 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
33Mohammad Mahdian, Yingyu Ye, Jiawei Zhang 0006 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
33Shiro Matuura, Tomomi Matsui 63-Approximation Algorithm for MAX DICUT. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
32Eran 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
32Mohammad 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
32Peng-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
32Moses 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
32Uriel 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
32Nikhil Bansal 0001, 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
32Anupam Gupta 0001, 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
32Sanjeev 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
32Walter 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
32Reuven 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
32Anand 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
31Dong 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
31Patricia 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
31Jianping Li 0007, 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
31Hengwu Li Approximation algorithm and scheme for RNA structure prediction. Search on Bibsonomy ICIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithm, approximation scheme, RNA structure, pseudoknot
31Joseph 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
31Baocang Wang, 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
30Shu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001 Computability of the Solutions to Navier-Stokes Equations via Effective Approximation. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
30Lane A. Hemaspaandra The Power of Self-Reducibility: Selectivity, Information, and Approximation. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
30Chi-Yeh Chen, Sun-Yuan Hsieh An Efficient Approximation Algorithm for the Steiner Tree Problem. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
30Sudha Balla, Jaime I. Dávila, Marius Nicolae, Sanguthevar Rajasekaran Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Artur Czumaj, Andrzej Lingas Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Yao-Ting Huang, Kui Zhang, Ting Chen 0006, Kun-Mao Chao Approximation Algorithms for the Selection of Robust Tag SNPs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Jing Yuan 0002, Weili Wu 0001, Sarat Chandra Varanasi Approximation and Heuristics for Community Detection. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Abdullah N. Arslan, Ömer Egecioglu Dynamic and Fractional Programming Based Approximation Algorithms for Sequence Alignment with Constraints. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert Stability of Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Jing Yuan 0002, Weili Wu 0001, Wen Xu 0005 Approximation for Influence Maximization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Devdatt P. Dubhashi, Fabrizio Grandoni 0001, Alessandro Panconesi Distributed Approximation Algorithms via LP-Duality and Randomization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Lan Wang, Xianping Wang, Stephan Olariu Approximation Algorithm for Clustering in Ad-hoc Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Sotiris E. Nikoletseas, Paul G. Spirakis Randomized Approximation Techniques. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi Approximation Algorithms for Facility Dispersion. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Jeremy Frank, Minh Do, J. Benton 0001 Approximation Algorithms and Heuristics for Classical Planning. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Hadas Shachnai, Tami Tamir Polynomial Time Approximation Schemes. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Sudipto Guha Histograms, Wavelets, Streams and Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Teofilo F. Gonzalez, Arturo Gonzalez-Gutierrez Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Rajeev Motwani 0001, Liadan O'Callaghan, An Zhu Asymptotic Polynomial Time Approximation Schemes. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Gianlorenzo D'Angelo, Alfredo Navarra, Maria Cristina Pinotti Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Giorgio Ausiello, Vangelis Th. Paschos Differential Ratio Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis Efficient Approximation Algorithms in Random Intersection Graphs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
30Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx 09511 Abstracts Collection - Parameterized complexity and approximation algorithms. Search on Bibsonomy Parameterized complexity and approximation algorithms The full citation details ... 2009 DBLP  BibTeX  RDF
30Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx 09511 Open Problems - Parameterized complexity and approximation algorithms. Search on Bibsonomy Parameterized complexity and approximation algorithms The full citation details ... 2009 DBLP  BibTeX  RDF
30Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx 09511 Executive Summary - Parameterized complexity and approximation algorithms. Search on Bibsonomy Parameterized complexity and approximation algorithms The full citation details ... 2009 DBLP  BibTeX  RDF
30Martin E. Dyer, Mark Jerrum, Marek Karpinski 08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Search on Bibsonomy Design and Analysis of Randomized and Approximation Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
30Xiang-Yang Li 0001, Weizhao Wang Approximation Algorithms and Algorithm Mechanism Design. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang Approximation Algorithms for Some Optimal 2D and 3D Triangulations. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Ömer Egecioglu, Abdullah N. Arslan Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic Stability of Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Alessandro Panconesi, Fabrizio Grandoni 0001, Devdatt P. Dubhashi Distributed Approximation Algorithms via LP-Duality and Randomization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Paul G. Spirakis, Sotiris E. Nikoletseas Randomized Approximation Techniques. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Kui Zhang, Kun-Mao Chao, Yao-Ting Huang, Ting Chen 0006 Approximation Algorithms for the Selection of Robust Tag SNPs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Mario Szegedy Hardness of Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30An Zhu, Rajeev Motwani 0001, Liadan O'Callaghan Asymptotic Polynomial-Time Approximation Schemes. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Jeremy Frank, Ari K. Jónsson Approximation Algorithms and Heuristics for Classical Planning. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Sudipto Guha Histograms, Wavelets, Streams, and Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Artur Czumaj, Andrzej Lingas Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Stephan Olariu, Lan Wang Approximation Algorithm for Clustering in Ad Hoc Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Laurent Gourvès, Evripidis Bampis, Eric Angel Approximation in Multiobjective Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Frits C. R. Spieksma, Sofia Kovaleva A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi Approximation Algorithms for Facility Dispersion. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Robert Preis, Burkhard Monien, Stefan Schamberger Approximation Algorithms for Multilevel Graph Partitioning. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Giorgio Ausiello, Vangelis Th. Paschos Differential Ratio Approximation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Joseph Y.-T. Leung Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Sudha Balla, Jaime I. Dávila, Sanguthevar Rajasekaran Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 42681 (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 L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license