|
|
Venues (Conferences, Journals, ...)
|
|
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 |
48 | Jan G. Bazan, Andrzej Skowron, Roman W. Swiniarski |
Rough Sets and Vague Concept Approximation: From Sample Approximation to Adaptive Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets V, pp. 39-62, 2006, Springer, 3-540-39382-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
higher order vagueness, rough sets, constraints, reinforcement learning, intelligent systems, incremental learning, adaptive learning, Vagueness, approximation space |
47 | Vladimir N. Temlyakov |
Nonlinear Methods of Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 3(1), pp. 33-107, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Classification. 41A17, 41A46, 41A65, 42A10, 46A35, 46C99, 46N40, 65J05, 41A25, 42C15, 65D15, 42C10, 46E35 |
44 | Richard G. Baraniuk, Ronald A. DeVore, George Kyriazis, X. M. Yu |
Near Best Tree Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 16(4), pp. 357-373, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
n-term approximation, approximation classes, compression, encoding |
40 | Jérôme Monnot, Sophie Toulouse |
Approximation Results for the Weighted P4 Partition Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 388-396, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
3-length chain, standard approximation, differential approximation, approximation algorithms, Graph partition, performance ratio |
40 | Guy Kortsarz, Zeev Nutov |
Approximating Node Connectivity Problems via Set Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(2), pp. 75-92, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Vertex connected spanning subgraph, Metric costs, Approximation algorithms |
40 | Wei-Zhi Wu 0001, Yee Leung, Wen-Xiu Zhang |
On Generalized Rough Fuzzy Approximation Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets V, pp. 263-284, 2006, Springer, 3-540-39382-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fuzzy topological spaces, rough sets, fuzzy sets, belief functions, binary relations, approximation operators, neighborhood systems, rough fuzzy sets |
38 | Thomas Hofmeister, Martin Hühne |
Semidefinite Programming and Its Applications to Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 263-298, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
38 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 779-794, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Zheng Fang 0004, Jie Wang 0002 |
Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings, pp. 188-199, 2008, Springer, 978-3-540-88581-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
point coverage, minimum set multicover, approximation algorithm, sensor deployment, LP-rounding |
37 | Tong-Jun Li |
Rough Approximation Operators in Covering Approximation Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSCTC ![In: Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Proceedings, pp. 174-182, 2006, Springer, 3-540-47693-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rough sets, partitions, coverings, Approximation operators |
36 | Moses Charikar, Balaji Raghavachari |
The Finite Capacity Dial-A-Ride Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 458-467, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
dial-a-ride, stacker crane, probabilistic approximation of metric spaces, algorithm, routing, approximation, capacity, vehicle, delivery, tree metric |
36 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster |
Approximation algorithms and hardness results for cycle packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 48, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap |
36 | Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap |
Pseudo approximation algorithms, with applications to optimal motion planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 170-178, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
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 |
36 | Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers, pp. 29-42, 2008, Springer, 978-3-540-93979-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS |
36 | Ashkan Aazami, Michael D. Stilp |
Approximation Algorithms and Hardness for Domination with Propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 1-15, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS |
36 | Armin Stahl |
Approximation of Utility Functions by Learning Similarity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic versus Approximation ![In: Logic versus Approximation, Essays Dedicated to Michael M. Richter on the Occasion of his 65th Birthday, pp. 150-172, 2004, Springer, 3-540-22562-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
Tight approximation algorithms for maximum general assignment problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 611-620, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Guy Kortsarz, Zeev Nutov |
Approximating node connectivity problems via set covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 194-205, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
35 | Jianmin Ma, Wen-Xiu Zhang, Wei-Zhi Wu 0001, Tong-Jun Li |
Granular Computing Based on a Generalized Approximation Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007, Proceedings, pp. 93-100, 2007, Springer, 978-3-540-72457-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Generalized approximation space, L??lower approximation operator, H??upper approximation operator, Similarity relation |
35 | Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov |
Best Basis Selection for Approximation in Lp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 3(2), pp. 161-185, 2003. The full citation details ...](Pics/full.jpeg) |
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 |
34 | Lashon B. Booker |
Adaptive value function approximations in classifier systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO Workshops ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Workshop Proceedings, Washington DC, USA, June 25-26, 2005, pp. 90-91, 2005, ACM. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyperplane coding, tile coding, reinforcement learning, learning classifier systems, function approximation |
34 | Karl Bringmann, Tobias Friedrich 0001 |
The maximum hypervolume set yields near-optimal approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 511-518, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximation, performance measures, multiobjective optimization, hypervolume indicator |
34 | Nam H. Nguyen, Thong T. Do, Trac D. Tran |
A fast and efficient algorithm for low-rank approximation of a matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 215-224, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
low rank matrix approximation, noncommutative khintchine inequality, structurally random matrix, singular value decomposition |
34 | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb |
Private approximation of search problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 119-128, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
private approximation, solution-list algorithm, vertex cover, secure computation |
34 | Rahul Garg 0001, Vijay Kumar, Vinayaka Pandit |
Approximation Algorithms for Budget-Constrained Auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 102-113, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
approximation algorithm, auctions, rounding, winner determination |
33 | William Zhu 0001, Fei-Yue Wang 0001 |
Binary Relation Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD ![In: Fuzzy Systems and Knowledge Discovery, Third International Conference, FSKD 2006, Xi'an, China, September 24-28, 2006, Proceedings, pp. 276-285, 2006, Springer, 3-540-45916-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Rough set, Fuzzy set, Granular computing, Binary relation, Upper approximation, Lower approximation |
33 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 231-243, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
33 | Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang |
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 355-366, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem |
33 | Detlef Sieling |
Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 41-62, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Michael M. Richter |
Logic and Approximation in Knowledge Based Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic versus Approximation ![In: Logic versus Approximation, Essays Dedicated to Michael M. Richter on the Occasion of his 65th Birthday, pp. 184-204, 2004, Springer, 3-540-22562-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Thomas Jansen 0001 |
Introduction to the Theory of Complexity and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 5-28, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Piotr Wasilewski |
Concept Lattices vs. Approximation Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC (1) ![In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31 - September 3, 2005, Proceedings, Part I, pp. 114-123, 2005, Springer, 3-540-28653-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Scot Anderson, Peter Z. Revesz |
Verifying the Incorrectness of Programs and Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings, pp. 1-13, 2005, Springer, 3-540-27872-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Erik D. Demaine, Nicole Immorlica |
Correlation Clustering with Partial Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 1-13, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang 0001 |
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 47-58, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Mohammad Mahdian, Yingyu Ye, Jiawei Zhang 0006 |
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 129-140, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Shiro Matuura, Tomomi Matsui |
63-Approximation Algorithm for MAX DICUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 138-146, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Eran Halperin, Robert Krauthgamer |
Polylogarithmic inapproximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 585-594, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
integrality ratio, polylogarithmic approximation, approximation algorithms, Steiner tree, hardness of approximation |
32 | Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni |
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(6), pp. 1345-1358, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ad hoc networks, approximation algorithms, topology control, graph model, power conservation, graph properties |
32 | Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi |
Minimum-power multicast routing in static ad hoc wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 12(3), pp. 507-514, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, power control, multicast routing |
32 | Moses Charikar, Sudipto Guha |
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 378-388, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
linear programming, approximation, local search, facility location, combinatorial algorithms, k-median |
32 | Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee |
Improved approximation algorithms for minimum-weight vertex separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 563-572, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings |
32 | Nikhil Bansal 0001, Avrim Blum, Shuchi Chawla 0001, Adam Meyerson |
Approximation algorithms for deadline-TSP and vehicle routing with time-windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 166-174, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, traveling salesman problem, orienteering, vehicle routing |
32 | Anupam Gupta 0001, Amit Kumar 0001, Tim Roughgarden |
Simpler and better approximation algorithms for network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 365-372, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, randomized algorithms, network design |
32 | Sanjeev Arora |
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(5), pp. 753-782, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
approximation algorithms, matching, traveling salesman problem, network design, Steiner problem |
32 | Walter Unger |
The Complexity of the Approximation of the Bandwidth Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 82-91, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
comlexity, approximation, bandwidth |
32 | Reuven Bar-Yehuda |
One for the Price of Two: A Unified Approach for Approximating Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 49-62, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set |
32 | Anand Srivastav, Katja Wolf |
Finding Dense Subgraphs with Semidefinite Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 181-191, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming |
31 | Dong Qiu, Lan Shu |
Rough Sets of System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 808-815, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
lower system approximation, upper system approximation, Rough sets, system, upper approximation, lower approximation |
31 | Patricia A. Evans, Andrew D. Smith |
Complexity of Approximating Closest Substring Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 210-221, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Closest Substring, Approximation algorithms, Hardness of approximation |
31 | Jianping 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](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 1-13, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service |
31 | Hengwu Li |
Approximation algorithm and scheme for RNA structure prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 1364-1367, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithm, approximation scheme, RNA structure, pseudoknot |
31 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(1), pp. 21-43, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems |
31 | Baocang Wang, Yupu Hu |
Diophantine Approximation Attack on a Fast Public Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPEC ![In: Information Security Practice and Experience, Second International Conference, ISPEC 2006, Hangzhou, China, April 11-14, 2006, Proceedings, pp. 25-32, 2006, Springer, 3-540-33052-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Simultaneous Diophantine approximation problem, Cryptanalysis, Public-key cryptosystem, Lattice basis reduction, Diophantine approximation |
30 | Shu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001 |
Computability of the Solutions to Navier-Stokes Equations via Effective Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complexity and Approximation ![In: Complexity and Approximation - In Memory of Ker-I Ko, pp. 80-112, 2020, Springer, 978-3-030-41671-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Lane A. Hemaspaandra |
The Power of Self-Reducibility: Selectivity, Information, and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complexity and Approximation ![In: Complexity and Approximation - In Memory of Ker-I Ko, pp. 19-47, 2020, Springer, 978-3-030-41671-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Chi-Yeh Chen, Sun-Yuan Hsieh |
An Efficient Approximation Algorithm for the Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complexity and Approximation ![In: Complexity and Approximation - In Memory of Ker-I Ko, pp. 238-251, 2020, Springer, 978-3-030-41671-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Sudha Balla, Jaime I. Dávila, Marius Nicolae, Sanguthevar Rajasekaran |
Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Artur Czumaj, Andrzej Lingas |
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Yao-Ting Huang, Kui Zhang, Ting Chen 0006, Kun-Mao Chao |
Approximation Algorithms for the Selection of Robust Tag SNPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Jing Yuan 0002, Weili Wu 0001, Sarat Chandra Varanasi |
Approximation and Heuristics for Community Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Abdullah N. Arslan, Ömer Egecioglu |
Dynamic and Fractional Programming Based Approximation Algorithms for Sequence Alignment with Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert |
Stability of Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 473-487, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Jing Yuan 0002, Weili Wu 0001, Wen Xu 0005 |
Approximation for Influence Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Devdatt P. Dubhashi, Fabrizio Grandoni 0001, Alessandro Panconesi |
Distributed Approximation Algorithms via LP-Duality and Randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 203-224, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Lan Wang, Xianping Wang, Stephan Olariu |
Approximation Algorithm for Clustering in Ad-hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Sotiris E. Nikoletseas, Paul G. Spirakis |
Randomized Approximation Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 189-201, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi |
Approximation Algorithms for Facility Dispersion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Jeremy Frank, Minh Do, J. Benton 0001 |
Approximation Algorithms and Heuristics for Classical Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 685-711, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Hadas Shachnai, Tami Tamir |
Polynomial Time Approximation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 125-156, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Sudipto Guha |
Histograms, Wavelets, Streams and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Teofilo F. Gonzalez, Arturo Gonzalez-Gutierrez |
Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Rajeev Motwani 0001, Liadan O'Callaghan, An Zhu |
Asymptotic Polynomial Time Approximation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 173-187, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Gianlorenzo 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](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Giorgio Ausiello, Vangelis Th. Paschos |
Differential Ratio Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 259-274, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Efficient Approximation Algorithms in Random Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (2) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications, 2018, Chapman and Hall/CRC, 9781351235426. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
30 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
09511 Abstracts Collection - Parameterized complexity and approximation algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parameterized complexity and approximation algorithms ![In: Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
30 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
09511 Open Problems - Parameterized complexity and approximation algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parameterized complexity and approximation algorithms ![In: Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
30 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
09511 Executive Summary - Parameterized complexity and approximation algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parameterized complexity and approximation algorithms ![In: Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
30 | Martin E. Dyer, Mark Jerrum, Marek Karpinski |
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Design and Analysis of Randomized and Approximation Algorithms ![In: Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
30 | Xiang-Yang Li 0001, Weizhao Wang |
Approximation Algorithms and Algorithm Mechanism Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang |
Approximation Algorithms for Some Optimal 2D and 3D Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
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](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic |
Stability of Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Alessandro Panconesi, Fabrizio Grandoni 0001, Devdatt P. Dubhashi |
Distributed Approximation Algorithms via LP-Duality and Randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Paul G. Spirakis, Sotiris E. Nikoletseas |
Randomized Approximation Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Kui Zhang, Kun-Mao Chao, Yao-Ting Huang, Ting Chen 0006 |
Approximation Algorithms for the Selection of Robust Tag SNPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Mario Szegedy |
Hardness of Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | An Zhu, Rajeev Motwani 0001, Liadan O'Callaghan |
Asymptotic Polynomial-Time Approximation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Jeremy Frank, Ari K. Jónsson |
Approximation Algorithms and Heuristics for Classical Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Sudipto Guha |
Histograms, Wavelets, Streams, and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Artur Czumaj, Andrzej Lingas |
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Stephan Olariu, Lan Wang |
Approximation Algorithm for Clustering in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Laurent Gourvès, Evripidis Bampis, Eric Angel |
Approximation in Multiobjective Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Frits C. R. Spieksma, Sofia Kovaleva |
A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi |
Approximation Algorithms for Facility Dispersion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Robert Preis, Burkhard Monien, Stefan Schamberger |
Approximation Algorithms for Multilevel Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Giorgio Ausiello, Vangelis Th. Paschos |
Differential Ratio Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Joseph Y.-T. Leung |
Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Sudha Balla, Jaime I. Dávila, Sanguthevar Rajasekaran |
Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|