The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1969-1979 (18) 1980-1984 (17) 1985-1987 (18) 1988-1989 (20) 1990 (18) 1991 (16) 1992 (17) 1993 (25) 1994 (26) 1995 (38) 1996 (48) 1997 (80) 1998 (104) 1999 (112) 2000 (113) 2001 (136) 2002 (149) 2003 (166) 2004 (233) 2005 (255) 2006 (291) 2007 (339) 2008 (228) 2009 (274) 2010 (117) 2011 (117) 2012 (99) 2013 (108) 2014 (112) 2015 (105) 2016 (108) 2017 (101) 2018 (114) 2019 (17)
Publication types (Num. hits)
article(1424) book(6) incollection(115) inproceedings(2132) phdthesis(49) proceedings(13)
Venues (Conferences, Journals, ...)
CoRR(237) APPROX-RANDOM(166) SODA(150) Algorithmica(139) STOC(123) FOCS(100) RANDOM-APPROX(95) Handbook of Approximation Algo...(86) ISAAC(76) ESA(74) APPROX(68) J. Comb. Optim.(60) Theor. Comput. Sci.(57) ACM Trans. Algorithms(51) IPCO(50) ICALP(48) More (+10 of total 543)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2812 occurrences of 962 keywords

Results
Found 3739 publication records. Showing 3739 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
52Guy Kortsarz, Zeev Nutov Approximating Node Connectivity Problems via Set Covers. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Vertex connected spanning subgraph, Metric costs, Approximation algorithms
47Anupam Gupta, Amit Kumar 0001, Tim Roughgarden Simpler and better approximation algorithms for network design. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF approximation algorithms, randomized algorithms, network design
47Thomas Hofmeister, Martin Hühne Semidefinite Programming and Its Applications to Approximation Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
47Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang 0001 Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Hai Huang, 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
46Guy Kortsarz, Zeev Nutov Approximating node connectivity problems via set covers. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
46Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ad hoc networks, approximation algorithms, topology control, graph model, power conservation, graph properties
45Sanjiv Kapoor, Mohammad Sarwat Bounded-Diameter Minimum-Cost Graph Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Anand Srivastav, Katja Wolf Finding Dense Subgraphs with Semidefinite Programming. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming
44Erik D. Demaine, Nicole Immorlica Correlation Clustering with Partial Information. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
44Eran Halperin, Aravind Srinivasan Improved Approximation Algorithms for the Partial Vertex Cover Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
44Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap Pseudo approximation algorithms, with applications to optimal motion planning. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2002 DBLP  DOI  BibTeX  RDF d 1-optimal motion, optimal motion planning, pseudo approximation, approximation algorithms, NP-hard problem, binary search, robot motion planning, Euclidean shortest path
42Bodo Manthey, L. Shankar Ram Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
42Rajiv Gandhi, Samir Khuller, Aravind Srinivasan Approximation Algorithms for Partial Covering Problems. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
41Gustav Hast Approximating Max kCSP Using Random Restrictions. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Sriram V. Pemmaraju, Rajiv Raman Approximation Algorithms for the Max-coloring Problem. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster Approximation algorithms and hardness results for cycle packing problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
41Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett Playing games with approximation algorithms. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF online linear optimization, approximation algorithms, regret minimization
41Raja Jothi, Balaji Raghavachari Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation algorithms, network design, Spanning trees, minimum spanning trees
41Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. Search on Bibsonomy ESA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization
40Maria-Florina Balcan, Avrim Blum Approximation algorithms and online mechanisms for item pricing. Search on Bibsonomy EC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF single minded, unlimited supply, approximation algorithms, combinatorial auctions, online optimization
40Stavros G. Kolliopoulos, Clifford Stein Improved Approximation Algorithms for Unsplittable Flow Problems. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
39Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott 0001 Improved approximations for multiprocessor scheduling under uncertainty. Search on Bibsonomy SPAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF scheduling under uncertainty, approximation algorithms, multiprocessor scheduling, stochastic scheduling
39Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar 0001 Approximation Algorithms for the Unsplittable Flow Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
39Anupam Gupta, 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
39Guy E. Blelloch, Kanat Tangwongsan Parallel approximation algorithms for facility-location problems. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF parallel algorithms, approximation algorithms, facility location problems
39Pierre 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
38Detlef Sieling Derandomization. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
38Daya Ram Gaur, Ramesh Krishnamurti Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. Search on Bibsonomy ISAAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut
37Chayant Tantipathananandh, Tanya Y. Berger-Wolf Constant-factor approximation algorithms for identifying dynamic communities. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, community identification, dynamic social networks
37Guolong Lin, Rajmohan Rajaraman Approximation algorithms for multiprocessor scheduling under uncertainty. Search on Bibsonomy SPAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF approximation algorithms, multiprocessor scheduling
37Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Approximation algorithms
37Esther 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
37Boulos Harb, Sampath Kannan, Andrew McGregor 0001 Approximating the Best-Fit Tree Under Lp Norms. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb Private approximation of search problems. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF private approximation, solution-list algorithm, vertex cover, secure computation
36Guoliang Xue, Weiyi Zhang, Jian Tang 0008, Krishnaiyan Thulasiraman Polynomial time approximation algorithms for multi-constrained QoS routing. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF efficient approximation algorithms, multiple additive constraints, quality-of-service (QoS) routing
36Patrick Briest, Piotr Krysta, Berthold Vöcking Approximation techniques for utilitarian mechanism design. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF combinatorial and multi-unit auctions, enumeration techniques, approximation algorithms, mechanism design, primal-dual method
36Sanjeev Arora Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation algorithms, matching, traveling salesman problem, network design, Steiner problem
36Anupam Gupta, Martin Pál, R. Ravi 0001, Amitabh Sinha What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF probabilistic analysis of algorithms, uncapacitated facilty location problem, approximation algorithms
35Reuven Bar-Yehuda One for the Price of Two: A Unified Approach for Approximating Covering Problems. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
35Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx 09511 Open Problems - Parameterized complexity and approximation algorithms. Search on Bibsonomy Parameterized complexity and approximation algorithms The full citation details ... 2009 DBLP  BibTeX  RDF
35Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx 09511 Abstracts Collection - Parameterized complexity and approximation algorithms. Search on Bibsonomy Parameterized complexity and approximation algorithms The full citation details ... 2009 DBLP  BibTeX  RDF
35Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx 09511 Executive Summary - Parameterized complexity and approximation algorithms. Search on Bibsonomy Parameterized complexity and approximation algorithms The full citation details ... 2009 DBLP  BibTeX  RDF
35Martin E. Dyer, Mark Jerrum, Marek Karpinski 08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Search on Bibsonomy Design and Analysis of Randomized and Approximation Algorithms The full citation details ... 2008 DBLP  BibTeX  RDF
35Alessandro Panconesi, Fabrizio Grandoni 0001, Devdatt P. Dubhashi Distributed Approximation Algorithms via LP-Duality and Randomization. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Xiang-Yang Li 0001, Weizhao Wang Approximation Algorithms and Algorithm Mechanism Design. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Ömer Egecioglu, Abdullah N. Arslan Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi Approximation Algorithms for Facility Dispersion. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Joseph Y.-T. Leung Approximation Algorithms for Imprecise Computation Tasks with 0/1 Constraint. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Jeremy Frank, Ari K. Jónsson Approximation Algorithms and Heuristics for Classical Planning. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang Approximation Algorithms for Some Optimal 2D and 3D Triangulations. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Sudha Balla, Jaime Davila, Sanguthevar Rajasekaran Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Robert Preis, Burkhard Monien, Stefan Schamberger Approximation Algorithms for Multilevel Graph Partitioning. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Kui Zhang, Kun-Mao Chao, Yao-Ting Huang, Ting Chen Approximation Algorithms for the Selection of Robust Tag SNPs. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Martin E. Dyer, Mark Jerrum, Marek Karpinski 05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Search on Bibsonomy Design and Analysis of Randomized and Approximation Algorithms The full citation details ... 2005 DBLP  BibTeX  RDF
35Thomas Jansen 0001 Introduction to the Theory of Complexity and Approximation Algorithms. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
35Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, stochastic optimization, cost sharing
35Benjamin E. Birnbaum, Kenneth J. Goldman An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Shalabh Bhatnagar Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization. Search on Bibsonomy ACM Trans. Model. Comput. Simul. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Adaptive three-timescale stochastic approximation algorithms, Newton-type algorithms, simultaneous perturbation stochastic approximation, simulation optimization
33Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Tobias Polzin, Siavash Vahdati Daneshmand Primal-dual approaches to the Steiner problem. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF dual-ascent, approximation algorithms, lower bound, relaxation, primal-dual, Steiner problem
33Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin Approximation algorithms for the metric labeling problem via a new linear programming formulation. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
33Samir Khuller, Robert Pless, Yoram J. Sussmann Fault Tolerant K-Center Problems. Search on Bibsonomy CIAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
33Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia Socially desirable approximations for Dodgson's voting rule. Search on Bibsonomy EC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dodgson's voting rule, approximation algorithms, social choice
33Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan Additive guarantees for degree bounded directed network design. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms, directed graphs, network design
33Guoliang Xue, S. Kami Makki Multiconstrained QoS Routing: A Norm Approach. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multiple additive QoS parameters, scaled p{hbox{-}}rm norm, approximation algorithms, QoS routing
33Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko Approximating Minimum-Power Degree and Connectivity Problems. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Gang Cheng, Nirwan Ansari, Li Zhu Enhancing epsilon-Approximation Algorithms With the Optimal Linear Scaling Factor. Search on Bibsonomy IEEE Trans. Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
32Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Combinatorial optimization, Set cover
32Zhi-Zhong Chen, Takayuki Nagoya Improved approximation algorithms for metric MaxTSP. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Max TSP, Metric Max TSP, Approximation Algorithms, Randomized Algorithms, TSP, Derandomization
32Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman Approximation Algorithms for Average Stretch Scheduling. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF average stretch, approximation algorithms, Scheduling algorithms
32Vijay Kumar, Atri Rudra Approximation Algorithms for Wavelength Assignment. Search on Bibsonomy FSTTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Sridhar Rajagopalan, Vijay V. Vazirani Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem
32Peng-Jun Wan Multiflows in multihop wireless networks. Search on Bibsonomy MobiHoc The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, multicommodity flow, capacity region
32Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 The Parameterized Approximability of TSP with Deadlines. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Doratha E. Drake, Stefan Hougardy Improved Linear Time Approximation Algorithms for Weighted Matchings. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Rahul Garg, Vijay Kumar, Vinayaka Pandit Approximation Algorithms for Budget-Constrained Auctions. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF approximation algorithm, auctions, rounding, winner determination
32Jie Wang 0002, Ning Zhong 0001 Efficient point coverage in wireless sensor networks. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithms, Linear programming, Sensor placement
32Patricia A. Evans, Andrew D. Smith Complexity of Approximating Closest Substring Problems. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Closest Substring, Approximation algorithms, Hardness of approximation
31Nikhil Bansal, Don Coppersmith, Baruch Schieber Minimizing Setup and Beam-On Times in Radiation Therapy. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas Approximation Algorithms for 3D Orthogonal Knapsack. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF geometric configurations, approximation algorithm, computational and structural complexity
31Artur Czumaj, Andrzej Lingas, Johan Nilsson Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. Search on Bibsonomy ISAAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
31Shai Gutner Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF prize collecting Steiner tree problem, Approximation algorithms, primal-dual, local ratio
31Retsef Levi, Andrea Lodi 0001, Maxim Sviridenko Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics
31Jon M. Kleinberg, Éva Tardos Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF metric labeling, classification, Approximation algorithms, Markov random fields
31Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. Search on Bibsonomy ISAAC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF approximation algorithms, network design, spanning trees
31Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Search on Bibsonomy MobiCom The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ad hoc network, approximation algorithm, topology control, graph model, power conservation, graph property
31Tapas 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 Symposium on Computational Geometry The full citation details ... 2002 DBLP  DOI  BibTeX  RDF clustering, approximation algorithms, computational geometry, local search, k-means
31Moses Charikar, Sudipto Guha Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF linear programming, approximation, local search, facility location, combinatorial algorithms, k-median
31Samarjit Chakraborty, Somenath Biswas Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. Search on Bibsonomy WADS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
31Hadas Shachnai, Tami Tamir Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
31Susanne Albers, Carsten Witt Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
31Michel X. Goemans Using Complex Semidefinite Programming for Approximating MAX E2-LIN3. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
30Dorit S. Hochbaum, David B. Shmoys Using dual approximation algorithms for scheduling problems theoretical and practical results. Search on Bibsonomy J. ACM The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
30Elif Akçali, Alper Üngör Approximation Algorithms for Degree-Constrained Bipartite Network Flow. Search on Bibsonomy ISCIS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF capacity allocation}, scheduling, Approximation algorithms, network flows
30Kamal Jain, Vijay V. Vazirani Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. Search on Bibsonomy J. ACM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF approximation algorithms, linear programming, Lagrangian relaxation, facility location problem, k-median problem
30Brian C. Dean, Adam Griffis, Adam A. Whitley Approximation Algorithms for k-Hurdle Problems. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Jianxin Wang, Min Huang, Jianer Chen A Lower Bound on Approximation Algorithms for the Closest Substring Problem. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3739 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license