|
|
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. |
Trans. Rough Sets |
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. |
Found. Comput. Math. |
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. |
Adv. Comput. Math. |
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. |
FCT |
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. |
Algorithmica |
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. |
Trans. Rough Sets |
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. |
Lectures on Proof Verification and Approximation Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
38 | Sanjiv Kapoor, Mohammad Sarwat |
Bounded-Diameter Minimum-Cost Graph Problems. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Zheng Fang 0004, Jie Wang 0002 |
Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem. |
WASA |
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. |
RSCTC |
2006 |
DBLP DOI BibTeX RDF |
rough sets, partitions, coverings, Approximation operators |
36 | Moses Charikar, Balaji Raghavachari |
The Finite Capacity Dial-A-Ride Problem. |
FOCS |
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. |
ACM Trans. Algorithms |
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. |
SCG |
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. |
WAOA |
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. |
APPROX-RANDOM |
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. |
Logic versus Approximation |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
Tight approximation algorithms for maximum general assignment problems. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Guy Kortsarz, Zeev Nutov |
Approximating node connectivity problems via set covers. |
APPROX |
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. |
RSKT |
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. |
Found. Comput. Math. |
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. |
GECCO Workshops |
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. |
GECCO |
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. |
STOC |
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. |
STOC |
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. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
approximation algorithm, auctions, rounding, winner determination |
33 | William Zhu 0001, Fei-Yue Wang 0001 |
Binary Relation Based Rough Sets. |
FSKD |
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. |
APPROX-RANDOM |
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. |
ICCSA (3) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem |
33 | Detlef Sieling |
Derandomization. |
Lectures on Proof Verification and Approximation Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Michael M. Richter |
Logic and Approximation in Knowledge Based Systems. |
Logic versus Approximation |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Thomas Jansen 0001 |
Introduction to the Theory of Complexity and Approximation Algorithms. |
Lectures on Proof Verification and Approximation Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Piotr Wasilewski |
Concept Lattices vs. Approximation Spaces. |
RSFDGrC (1) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Scot Anderson, Peter Z. Revesz |
Verifying the Incorrectness of Programs and Automata. |
SARA |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Erik D. Demaine, Nicole Immorlica |
Correlation Clustering with Partial Information. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang 0001 |
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Mohammad Mahdian, Yingyu Ye, Jiawei Zhang 0006 |
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Shiro Matuura, Tomomi Matsui |
63-Approximation Algorithm for MAX DICUT. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Eran Halperin, Robert Krauthgamer |
Polylogarithmic inapproximability. |
STOC |
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. |
IEEE/ACM Trans. Netw. |
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. |
IEEE/ACM Trans. Netw. |
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. |
FOCS |
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. |
STOC |
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. |
STOC |
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. |
STOC |
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. |
J. ACM |
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. |
FOCS |
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. |
APPROX |
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. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming |
31 | Dong Qiu, Lan Shu |
Rough Sets of System. |
ICFIE |
2007 |
DBLP DOI BibTeX RDF |
lower system approximation, upper system approximation, Rough sets, system, upper approximation, lower approximation |
31 | Patricia A. Evans, Andrew D. Smith |
Complexity of Approximating Closest Substring Problems. |
FCT |
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. |
COCOA |
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. |
ICIS |
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. |
Algorithmica |
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. |
ISPEC |
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. |
Complexity and Approximation |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Lane A. Hemaspaandra |
The Power of Self-Reducibility: Selectivity, Information, and Approximation. |
Complexity and Approximation |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Chi-Yeh Chen, Sun-Yuan Hsieh |
An Efficient Approximation Algorithm for the Steiner Tree Problem. |
Complexity and Approximation |
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. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Artur Czumaj, Andrzej Lingas |
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
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. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Jing Yuan 0002, Weili Wu 0001, Sarat Chandra Varanasi |
Approximation and Heuristics for Community Detection. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Abdullah N. Arslan, Ömer Egecioglu |
Dynamic and Fractional Programming Based Approximation Algorithms for Sequence Alignment with Constraints. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert |
Stability of Approximation. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Jing Yuan 0002, Weili Wu 0001, Wen Xu 0005 |
Approximation for Influence Maximization. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Devdatt P. Dubhashi, Fabrizio Grandoni 0001, Alessandro Panconesi |
Distributed Approximation Algorithms via LP-Duality and Randomization. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Lan Wang, Xianping Wang, Stephan Olariu |
Approximation Algorithm for Clustering in Ad-hoc Networks. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Sotiris E. Nikoletseas, Paul G. Spirakis |
Randomized Approximation Techniques. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi |
Approximation Algorithms for Facility Dispersion. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Jeremy Frank, Minh Do, J. Benton 0001 |
Approximation Algorithms and Heuristics for Classical Planning. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Hadas Shachnai, Tami Tamir |
Polynomial Time Approximation Schemes. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Sudipto Guha |
Histograms, Wavelets, Streams and Approximation. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Teofilo F. Gonzalez, Arturo Gonzalez-Gutierrez |
Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Rajeev Motwani 0001, Liadan O'Callaghan, An Zhu |
Asymptotic Polynomial Time Approximation Schemes. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
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. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Giorgio Ausiello, Vangelis Th. Paschos |
Differential Ratio Approximation. |
Handbook of Approximation Algorithms and Metaheuristics (1) |
2018 |
DBLP DOI BibTeX RDF |
|
30 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Efficient Approximation Algorithms in Random Intersection Graphs. |
Handbook of Approximation Algorithms and Metaheuristics (2) |
2018 |
DBLP BibTeX RDF |
|
30 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
09511 Abstracts Collection - Parameterized complexity and approximation algorithms. |
Parameterized complexity and approximation algorithms |
2009 |
DBLP BibTeX RDF |
|
30 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
09511 Open Problems - Parameterized complexity and approximation algorithms. |
Parameterized complexity and approximation algorithms |
2009 |
DBLP BibTeX RDF |
|
30 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx |
09511 Executive Summary - Parameterized complexity and approximation algorithms. |
Parameterized complexity and approximation algorithms |
2009 |
DBLP BibTeX RDF |
|
30 | Martin E. Dyer, Mark Jerrum, Marek Karpinski |
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. |
Design and Analysis of Randomized and Approximation Algorithms |
2008 |
DBLP BibTeX RDF |
|
30 | Xiang-Yang Li 0001, Weizhao Wang |
Approximation Algorithms and Algorithm Mechanism Design. |
Handbook of Approximation Algorithms and Metaheuristics |
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. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Ömer Egecioglu, Abdullah N. Arslan |
Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic |
Stability of Approximation. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Alessandro Panconesi, Fabrizio Grandoni 0001, Devdatt P. Dubhashi |
Distributed Approximation Algorithms via LP-Duality and Randomization. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Paul G. Spirakis, Sotiris E. Nikoletseas |
Randomized Approximation Techniques. |
Handbook of Approximation Algorithms and Metaheuristics |
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. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Mario Szegedy |
Hardness of Approximation. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | An Zhu, Rajeev Motwani 0001, Liadan O'Callaghan |
Asymptotic Polynomial-Time Approximation Schemes. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Jeremy Frank, Ari K. Jónsson |
Approximation Algorithms and Heuristics for Classical Planning. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Sudipto Guha |
Histograms, Wavelets, Streams, and Approximation. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Artur Czumaj, Andrzej Lingas |
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Stephan Olariu, Lan Wang |
Approximation Algorithm for Clustering in Ad Hoc Networks. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Laurent Gourvès, Evripidis Bampis, Eric Angel |
Approximation in Multiobjective Problems. |
Handbook of Approximation Algorithms and Metaheuristics |
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. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi |
Approximation Algorithms for Facility Dispersion. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Robert Preis, Burkhard Monien, Stefan Schamberger |
Approximation Algorithms for Multilevel Graph Partitioning. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Giorgio Ausiello, Vangelis Th. Paschos |
Differential Ratio Approximation. |
Handbook of Approximation Algorithms and Metaheuristics |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Joseph Y.-T. Leung |
Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. |
Handbook of Approximation Algorithms and Metaheuristics |
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. |
Handbook of Approximation Algorithms and Metaheuristics |
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][ >>] |
|