The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1956-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
26Ovidiu Daescu New Results on Path Approximation. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Path approximation, Curve simplification, Optimization, Complexity, Line transversal
26Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding
26Esther M. Arkin, Michael A. Bender, Dongdong Ge Improved approximation algorithms for the freeze-tag problem. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF freeze-tag problem, minimum broadcast-time problem, minimum gossip time problem, multicast problem, scheduling, approximation algorithms, NP-hardness, TSP, data dissemination, swarm robotics, network optimization
26Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu A local search approximation algorithm for k-means clustering. Search on Bibsonomy SCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF clustering, approximation algorithms, computational geometry, local search, k-means
26Hai Huang 0011, Andréa W. Richa, Michael Segal 0001 Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. Search on Bibsonomy DIAL-M The full citation details ... 2002 DBLP  DOI  BibTeX  RDF piercing set, clustering, approximation algorithms, mobile ad-hoc networks, distributed protocols
26Xiaobo Hu 0001, Danny Z. Chen, Rajeshkumar S. Sambandam Efficient list-approximation techniques for floorplan area minimization. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF k-link shortest paths, list approximation, floorplanning, area minimization
26Pierre Fraigniaud Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. Search on Bibsonomy ESA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Minimum Degree Spanning Tree, Approximation Algorithms, Multicasting, Broadcasting, Gossiping, Graph and Network Algorithms
26Sudipto Guha, Samir Khuller Approximation Algorithms for Connected Dominating Sets. Search on Bibsonomy Algorithmica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Approximation algorithms, Graph algorithms, Steiner trees, Dominating sets
26Rolf Harren, Rob van Stee Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF two-dimensional bin packing, absolute worst-case ratio, approximation algorithm, strip packing, rectangle packing
26Anupam Gupta 0001, Amit Kumar 0001, Martin Pál, Tim Roughgarden Approximation via cost sharing: Simpler and better approximation algorithms for network design. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Approximation algorithms, network design, random sampling, cost sharing
26David Coudert, Hervé Rivano, Xavier Roche A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. Search on Bibsonomy WAOA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF combinatorial approximation, Multicommodity flow, incremental algorithm, dynamic shortest paths
25Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Manhattan distance, Clustering, Approximation, Supercomputers, Communication cost, Processor allocation, Polynomial-time approximation scheme (PTAS)
25Zhixiang Chen 0001, Richard H. Fowler, Bin Fu, Binhai Zhu On the inapproximability of the exemplar conserved interval distance problem of genomes. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Exemplar conserved interval distance, Weak approximation, Approximation algorithm, Genome rearrangement, Inapproximability
25Konstantin Andreev, Harald Räcke Balanced graph partitioning. Search on Bibsonomy SPAA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF approximation algorithms, graph partitioning, bicriteria approximation
25Piotr Berman, Marek Karpinski On Some Tighter Inapproximability Results (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
25Yuval Rabani, Gabriel Scalosub Bicriteria approximation tradeoff for the node-cost budget problem. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, bicriteria approximation
25Marek Karpinski, Warren Schudy Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Gale-Berlekamp game, correlation and hierarchical clustering, dense instances, linear time approximation schemes, minimum constraint satisfaction, nearest codeword problem, approximation algorithms
25Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems. Search on Bibsonomy ICCSA (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF approximation algorithm, polynomial time approximation scheme (PTAS), combinatorial optimization problem, k-tree
25Daniel Goujot Blind Wavelet Compression of the Solution of a Nonlinear PDE with Singular Forcing Term Within Optimal Order Cost: Stability of Restricted Approximation to Small Errors. Search on Bibsonomy J. Sci. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF restricted adaptive approximation, Besov spaces, Wavelets, nonlinear approximation, elliptic equations
25Shai Dekel, Dany Leviatan Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Piecewise polynomial approximation, Whitney estimates, Johns theorem, Nonlinear approximation
25Martin Stepnicka, Stephan Lehmke Approximation of Fuzzy Functions by Extended Fuzzy Transforms. Search on Bibsonomy Fuzzy Days The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Fuzzy approximation, Fuzzy transforms, Approximation, Fuzzy sets, Fuzzy control, Normal forms
25Ming-Jun Lai, Larry L. Schumaker On the approximation power of bivariate splines. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation order by splines, stable approximation schemes, super-splines, 41A63, 41A15, 41A25, 65D10, bivariate splines
25Ding-Zhu Du, Jie Wang 0002 (eds.) Complexity and Approximation - In Memory of Ker-I Ko Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Erfang Shan, Jilei Shi, Wenrong Lv A Note on the Position Value for Hypergraph Communication Situations. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Ding-Zhu Du, Jie Wang 0002 In Memoriam: Ker-I Ko (1950-2018). Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Qingqin Nong, Suning Gong, Qizhi Fang, Ding-Zhu Du A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Eric Allender Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Jie Wang 0002 AutoOverview: A Framework for Generating Structured Overviews over Many Documents. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Chuanwen Luo, Liya Xu, Deying Li 0001, Weili Wu 0001 Edge Computing Integrated with Blockchain Technologies. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Shuichi Hirahara, Osamu Watanabe 0001 On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Siwen Liu A Review for Submodular Optimization on Machine Scheduling Problems. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Xiaoming Sun 0001, Yuan Sun 0007, Jialin Zhang 0001 Better Upper Bounds for Searching on a Line with Byzantine Robots. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Jack H. Lutz, Neil Lutz Who Asked Us? How the Theory of Computing Answers Questions about Analysis. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Jan-Hendrik Lorenz, Uwe Schöning Promise Problems on Probability Distributions. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Feiteng Zhang, Bin Liu 0009, Qizhi Fang Core Decomposition, Maintenance and Applications. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Vincent Chau, Minming Li Active and Busy Time Scheduling Problem: A Survey. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Xujin Chen, Xiaodong Hu 0001, Mengqi Zhang Sequential Location Game on Continuous Directional Star Networks. Search on Bibsonomy Complexity and Approximation The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Teofilo F. Gonzalez Basic Methodologies and Applications. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Holger H. Hoos, Thomas Stützle Empirical Analysis of Randomised Algorithms. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Fred W. Glover, Manuel Laguna, Rafael Martí Principles and Strategies of Tabu Search. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Bhaskar DasGupta, Derong Liu 0001, Hava T. Siegelmann Neural Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Teofilo F. Gonzalez Introduction, Overview, and Notation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Roberto Solis-Oba, Nasim Samei Local Search. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Leah Epstein, Rob van Stee Multidimensional Packing Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25János Csirik, György Dósa Performance Guarantees for One Dimensional Bin Packing. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Samir Khuller, Balaji Raghavachari, Neal E. Young Greedy Methods. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Guy Even Recursive Greedy Methods. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Niv Buchbinder, Moran Feldman Submodular Functions Maximization Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Holger H. Hoos, Thomas Stützle Stochastic Local Search. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Peter R. Cappello, Christopher James Coakley A Development and Deployment Framework for Distributed Branch-and-Bound. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25David Fernández-Baca, Balaji Venkatachalam Sensitivity Analysis in Combinatorial Optimization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Ding-Zhu Du, Weili Wu 0001 Approximations for Steiner Minimum Trees. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25János Csirik, Csanád Imreh Variants of Classical One Dimensional Bin Packing. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Dror Rawitz Local Ratio. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Daya Ram Gaur, Ramesh Krishnamurti LP Rounding and Extensions. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Giorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela Prize Collecting Traveling Salesman and Related Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Celso S. Sakuraba, Mutsunori Yagiura Linear Ordering Problem. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Roberto Battiti, Mauro Brunato Reactive Search: Machine Learning for Memory-Based Heuristics. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura Practical Algorithms for Two-Dimensional Packing of General Shapes. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Wei Wu 0017, Mutsunori Yagiura, Toshihide Ibaraki Generalized Assignment Problem. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky Practical Approximations of Steiner Trees in Uniform Orientation Metrics. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Luís Paquete, Thomas Stützle Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi Practical Algorithms for Two-Dimensional Packing of Rectangles. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Guillermo Leguizamón, Christian Blum 0001, Enrique Alba 0001 Evolutionary Computation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Giorgio Ausiello, Vangelis Th. Paschos Reductions That Preserve Approximability. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Marco Dorigo, Krzysztof Socha An Introduction to Ant Colony Optimization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Magnús M. Halldórsson, Guy Kortsarz Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25János Csirik Variable Sized Bin Packing and Bin Covering. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Sartaj Sahni Rounding, Interval Partitioning and Separation. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Teofilo F. Gonzalez Restriction Methods. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm Reoptimization of Hard Optimization Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Zeev Nutov Node-Connectivity Survivable Network Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Teofilo F. Gonzalez, Si-Qing Zheng Minimum Edge Length Rectangular Partitions. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Teofilo F. Gonzalez Introduction, Overview and Definitions. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Zeev Nutov Activation Network Design Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Ion I. Mandoiu, Alex Olshevsky, Alexander Zelikovsky QoS Multimedia Multicast Routing. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Michiel H. M. Smid The Well-Separated Pair Decomposition and Its Applications. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Konstantinos G. Kakoulis, Ioannis G. Tollis Automatic Placement of Labels in Maps and Drawings. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Zeev Nutov The k-Connected Subgraph Problem. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Jason Cong, Joseph R. Shinnerl Large-Scale Global Placement. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Xianping Wang, Stephan Olariu Strategies for Aggregating Time-discounted Information in Sensor Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Stavros G. Kolliopoulos Disjoint Paths and Unsplittable Flow. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Andréa W. Richa, Christian Scheideler Overlay Networks for Peer-to-Peer Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Maria J. Blesa, Christian Blum 0001 On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Hossein Ghasemalizadeh, Mohammadreza Razzazi Covering with Unit Balls. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Zhigang Xiang Color Quantization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Gruia Calinescu, Cristina G. Fernandes Maximum Planar Subgraph. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Pedro M. Ruiz, Ivan Stojmenovic Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Gruia Calinescu, Errol L. Lloyd, S. S. Ravi Topology Control Problems for Wireless Ad hoc Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Joseph Thomas, Debasish Ghose A GSO based Swarm Algorithm for Odor Source Localization in Turbulent Environments. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Joachim Gudmundsson, Christian Knauer Dilation and Detours in Geometric Networks. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Roberto Battiti, Anurag Garg Digital Reputation for Virtual Communities. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Marco Chiarandini, Irina Dumitrescu, Thomas Stützle Stochastic Local Search Algorithms for the Graph Colouring Problem. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Bang Ye Wu, Chuan Yi Tang, Kun-Mao Chao Optimum Communication Spanning Trees. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25Ragesh Jaiswal, Sandeep Sen Approximate Clustering. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics (2) The full citation details ... 2018 DBLP  BibTeX  RDF
25 Abstraction, Reformulation, and Approximation, Papers from the 2010 AAAI Workshop, Atlanta, Georgia, USA, July 12, 2010 Search on Bibsonomy Abstraction, Reformulation, and Approximation The full citation details ... 2010 DBLP  BibTeX  RDF
25Xiaoming Zheng, Sven Koenig Market-Based Algorithms for Allocating Complex Tasks. Search on Bibsonomy Abstraction, Reformulation, and Approximation The full citation details ... 2010 DBLP  BibTeX  RDF
25Gregory M. Provan, Ashish Sabharwal Preface. Search on Bibsonomy Abstraction, Reformulation, and Approximation The full citation details ... 2010 DBLP  BibTeX  RDF
Displaying result #201 - #300 of 42681 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][>>]
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