default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHandbook of Approximation Algorithms and Metaheuristics 2007
- Teofilo F. Gonzalez:
Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC 2007, ISBN 978-1-58488-550-4 - Teofilo F. Gonzalez:
Introduction, Overview, and Notation. - Teofilo F. Gonzalez:
Basic Methodologies and Applications. - Teofilo F. Gonzalez:
Restriction Methods. - Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. - Guy Even:
Recursive Greedy Methods. - Yuval Rabani
:
Linear Programming. - Ramesh Krishnamurti, Daya Ram Gaur:
LP Rounding and Extensions. - Jiawei Zhang, Yinyu Ye, Anthony Man-Cho So:
On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems. - Hadas Shachnai, Tami Tamir:
Polynomial-Time Approximation Schemes. - Sartaj Sahni:
Rounding, Interval Partitioning, and Separation. - An Zhu, Rajeev Motwani, Liadan O'Callaghan:
Asymptotic Polynomial-Time Approximation Schemes. - Paul G. Spirakis, Sotiris E. Nikoletseas:
Randomized Approximation Techniques. - Alessandro Panconesi, Fabrizio Grandoni, Devdatt P. Dubhashi:
Distributed Approximation Algorithms via LP-Duality and Randomization. - Holger H. Hoos, Thomas Stützle:
Empirical Analysis of Randomized Algorithms. - Giorgio Ausiello, Vangelis Th. Paschos:
Reductions That Preserve Approximability. - Giorgio Ausiello, Vangelis Th. Paschos:
Differential Ratio Approximation. - Mario Szegedy:
Hardness of Approximation. - Roberto Solis-Oba:
Local Search. - Holger H. Hoos, Thomas Stützle:
Stochastic Local Search. - Özlem Ergun, Abraham P. Punnen, James B. Orlin, Ravindra K. Ahuja:
Very Large-Scale Neighborhood Search. - Mauro Brunato, Roberto Battiti:
Reactive Search. - Hava T. Siegelmann, Bhaskar DasGupta, Derong Liu:
Neural Networks. - Rafael Martí, Manuel Laguna, Fred W. Glover:
Principles of Tabu Search. - Guillermo Leguizamón, Enrique Alba, Christian Blum:
Evolutionary Computation. - Jan H. M. Korst, Emile H. L. Aarts, Wil Michiels:
Simulated Annealing. - Marco Dorigo, Krzysztof Socha:
Ant Colony Optimization. - Carlos Cotta, Pablo Moscato:
Memetic Algorithms. - Laurent Gourvès, Evripidis Bampis, Eric Angel:
Approximation in Multiobjective Problems. - Luís Paquete, Thomas Stützle:
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization. - Balaji Venkatachalam, David Fernández-Baca:
Sensitivity Analysis in Combinatorial Optimization. - Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic:
Stability of Approximation. - Edward G. Coffman Jr., János Csirik:
Performance Guarantees for One-Dimensional Bin Packing. - Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variants of Classical One-Dimensional Bin Packing. - Edward G. Coffman Jr., Joseph Y.-T. Leung, János Csirik:
Variable-Sized Bin Packing and Bin Covering. - Leah Epstein, Rob van Stee:
Multidimensional Packing Problems. - Mutsunori Yagiura, Hiroshi Nagamochi, Shinji Imahori:
Practical Algorithms for Two-Dimensional Packing. - Frits C. R. Spieksma, Sofia Kovaleva:
A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Stabbing Problem. - Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi:
Approximation Algorithms for Facility Dispersion. - Jiawei Zhang, Yinyu Ye, Anthony Man-Cho So:
Greedy Algorithms for Metric Facility Location Problems. - Alberto Marchetti-Spaccamela, Vincenzo Bonifaci, Stefano Leonardi, Giorgio Ausiello:
Prize-Collecting Traveling Salesman and Related Problems. - Peter R. Cappello, Christopher James Coakley:
A Development and Deployment Framework for Distributed Branch and Bound. - Weili Wu, Ding-Zhu Du:
Approximations for Steiner Minimum Trees. - Ion I. Mandoiu, Andrew B. Kahng, Alexander Zelikovsky:
Practical Approximations of Steiner Trees in Uniform Orientation Metrics. - Joseph Y.-T. Leung:
Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. - Hu Zhang, Klaus Jansen:
Scheduling Malleable Tasks. - Yoshiyuki Karuno, Hiroshi Nagamochi:
Vehicle Scheduling Problems in Graphs. - Jeremy Frank, Ari K. Jónsson:
Approximation Algorithms and Heuristics for Classical Planning. - Toshihide Ibaraki, Mutsunori Yagiura:
Generalized Assignment Problem. - Ramesh Krishnamurti, Rajeev Kohli:
Probabilistic Greedy Heuristics for Satisfiability Problems. - Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation Algorithms for Some Optimal 2D and 3D Triangulations. - Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. - Joachim Gudmundsson, Christian Knauer:
Dilation and Detours in Geometric Networks. - Michiel H. M. Smid:
The Well-Separated Pair Decomposition and Its Applications. - Si-Qing Zheng, Teofilo F. Gonzalez:
Minimum-Edge Length Rectangular Partitions. - Silvia Ghilezan, Jovisa D. Zunic, Jovanka Pantovic:
Partitioning Finite d-Dimensional Integer Grids with Applications. - Cristina G. Fernandes, Gruia Calinescu:
Maximum Planar Subgraph. - Stavros G. Kolliopoulos:
Edge-Disjoint Paths and Unsplittable Flow. - Guy Kortsarz, Zeev Nutov:
Approximating Minimum-Cost Connectivity Problems. - Chuan Yi Tang, Kun-Mao Chao, Bang Ye Wu:
Optimum Communication Spanning Trees. - Robert Preis, Burkhard Monien, Stefan Schamberger:
Approximation Algorithms for Multilevel Graph Partitioning. - David A. Papa, Igor L. Markov:
Hypergraph Partitioning and Clustering. - Hong Shen:
Finding Most Vital Edges in a Graph. - Thomas Stützle, Irina Dumitrescu, Marco Chiarandini:
Stochastic Local Search Algorithms for the Graph Coloring Problem. - Maria J. Blesa, Christian Blum:
On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization. - Ivan Stojmenovic, Pedro M. Ruiz:
Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks. - Stephan Olariu, Lan Wang:
Approximation Algorithm for Clustering in Ad Hoc Networks. - S. S. Ravi, Errol L. Lloyd:
Topology Control Problems for Wireless Ad Hoc Networks. - Yu Wang, Xiang-Yang Li:
Geometrical Spanner for Wireless Ad Hoc Networks. - Hui Tian, Hong Shen:
Multicast Topology Inference and Its Applications. - Sing-Ling Lee, RongJou Yang, Hann-Jang Ho:
Multicast Congestion in Ring Networks. - Ion I. Mandoiu, Alex Olshevsky, Alexander Zelikovsky:
QoS Multimedia Multicast Routing. - Andréa W. Richa, Christian Scheideler:
Overlay Networks for Peer-to-Peer Networks. - Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Scheduling Data Broadcasts on Wireless Channels. - Michael A. Langston, Carlos Cotta, Pablo Moscato:
Combinatorial and Algorithmic Issues for Microarray Analysis. - Sudha Balla, Jaime I. Dávila, Sanguthevar Rajasekaran:
Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems. - Ömer Egecioglu, Abdullah N. Arslan:
Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. - Kui Zhang, Kun-Mao Chao, Yao-Ting Huang, Ting Chen:
Approximation Algorithms for the Selection of Robust Tag SNPs. - Danny Z. Chen, Jinhui Xu:
Sphere Packing and Medical Applications. - Joseph R. Shinnerl, Jason Cong:
Large-Scale Global Placement. - Ion I. Mandoiu, Andrew B. Kahng, Christoph Albrecht, Alexander Zelikovsky:
Multicommodity Flow Algorithms for Buffered Global Routing. - Evripidis Bampis, Eric Angel, Fanny Pascual:
Algorithmic Game Theory and Scheduling. - Li-Sha Huang, Xiaotie Deng:
Approximate Economic Equilibrium Algorithms. - Xiang-Yang Li, Weizhao Wang:
Approximation Algorithms and Algorithm Mechanism Design. - Sudipto Guha:
Histograms, Wavelets, Streams, and Approximation. - Roberto Battiti, Anurag Garg:
Digital Reputation for Virtual Communities. - Zhigang Xiang:
Color Quantization.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-12 22:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
