Search results for "approximation algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Eran Halperin, Aravind Srinivasan	Improved Approximation Algorithms for the Partial Vertex Cover Problem.	APPROX	2002	DBLP DOI BibTeX RDF	Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
4	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
3	Guy E. Blelloch, Kanat Tangwongsan	Parallel approximation algorithms for facility-location problems.	SPAA	2010	DBLP DOI BibTeX RDF	parallel algorithms, approximation algorithms, facility location problems
3	Bodo Manthey, L. Shankar Ram	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
3	Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis	Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Set cover
3	Zhi-Zhong Chen, Lusheng Wang	Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats.	IEEE/ACM Trans. Comput. Biology Bioinform.	2009	DBLP DOI BibTeX RDF	approximation algorithms, Computational biology
3	Laurent Bulteau, Guillaume Fertin, Irena Rusu	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms.	ISAAC	2009	DBLP DOI BibTeX RDF	comparative maps, genome comparison, synteny blocks, approximation algorithms, algorithmic complexity
3	Chayant Tantipathananandh, Tanya Y. Berger-Wolf	Constant-factor approximation algorithms for identifying dynamic communities.	KDD	2009	DBLP DOI BibTeX RDF	approximation algorithms, community identification, dynamic social networks
3	Robert W. Irving, David Manlove	Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Weak stability, Approximation algorithms, NP-hard problems, Stable matching
3	Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman	Polynomial time approximation algorithms for multi-constrained QoS routing.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	efficient approximation algorithms, multiple additive constraints, quality-of-service (QoS) routing
3	Shai Gutner	Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.	COCOA	2008	DBLP DOI BibTeX RDF	prize collecting Steiner tree problem, Approximation algorithms, primal-dual, local ratio
3	Zhi-Zhong Chen, Takayuki Nagoya	Improved approximation algorithms for metric MaxTSP.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Max TSP, Metric Max TSP, Approximation Algorithms, Randomized Algorithms, TSP, Derandomization
3	Refael Hassin, Jérôme Monnot, Danny Segev	Approximation algorithms and hardness results for labeled connectivity problems.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Labeled connectivity, Approximation algorithms, Hardness of approximation
3	Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster	Approximation algorithms and hardness results for cycle packing problems.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
3	Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden	Approximation via cost sharing: Simpler and better approximation algorithms for network design.	J. ACM	2007	DBLP DOI BibTeX RDF	Approximation algorithms, network design, random sampling, cost sharing
3	Guolong Lin, Rajmohan Rajaraman	Approximation algorithms for multiprocessor scheduling under uncertainty.	SPAA	2007	DBLP DOI BibTeX RDF	approximation algorithms, multiprocessor scheduling
3	Retsef Levi, Andrea Lodi, Maxim Sviridenko	Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.	IPCO	2007	DBLP DOI BibTeX RDF	scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics
3	Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett	Playing games with approximation algorithms.	STOC	2007	DBLP DOI BibTeX RDF	online linear optimization, approximation algorithms, regret minimization
3	Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan	Approximation algorithms for shop scheduling problems with minsum objective: A correction.	J. Scheduling	2006	DBLP DOI BibTeX RDF	Shop scheduling, Approximation algorithms
3	Maria-Florina Balcan, Avrim Blum	Approximation algorithms and online mechanisms for item pricing.	ACM Conference on Electronic Commerce	2006	DBLP DOI BibTeX RDF	single minded, unlimited supply, approximation algorithms, combinatorial auctions, online optimization
3	Shalabh Bhatnagar	Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization.	ACM Trans. Model. Comput. Simul.	2005	DBLP DOI BibTeX RDF	Adaptive three-timescale stochastic approximation algorithms, Newton-type algorithms, simultaneous perturbation stochastic approximation, simulation optimization
3	Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang	Near-Linear Time Approximation Algorithms for Curve Simplification.	Algorithmica	2005	DBLP DOI BibTeX RDF	Curve simplification, Approximation algorithms, Computational geometry
3	Raja Jothi, Balaji Raghavachari	Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.	ACM Transactions on Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, network design, Spanning trees, minimum spanning trees
3	Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko	Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.	J. ACM	2005	DBLP DOI BibTeX RDF	Approximation algorithms
3	Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha	What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
3	Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera	On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem.	STOC	2005	DBLP DOI BibTeX RDF	probabilistic analysis of algorithms, uncapacitated facilty location problem, approximation algorithms
3	Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman	Approximation Algorithms for Average Stretch Scheduling.	J. Scheduling	2004	DBLP DOI BibTeX RDF	average stretch, approximation algorithms, Scheduling algorithms
3	Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha	Boosted sampling: approximation algorithms for stochastic optimization.	STOC	2004	DBLP DOI BibTeX RDF	boosted sampling, approximation algorithms, stochastic optimization, cost sharing
3	Sergio Cabello, Marc J. van Kreveld	Approximation Algorithms for Aligning Points.	Algorithmica	2003	DBLP DOI BibTeX RDF	Point placement, Approximation algorithms, Cartography, Geometric optimization
3	Esther M. Arkin, Michael A. Bender, Dongdong Ge	Improved approximation algorithms for the freeze-tag problem.	SPAA	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
3	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang	Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
3	Elif Akçali, Alper Üngör	Approximation Algorithms for Degree-Constrained Bipartite Network Flow.	ISCIS	2003	DBLP DOI BibTeX RDF	capacity allocation}, scheduling, Approximation algorithms, network flows
3	Anupam Gupta, Amit Kumar, Tim Roughgarden	Simpler and better approximation algorithms for network design.	STOC	2003	DBLP DOI BibTeX RDF	approximation algorithms, randomized algorithms, network design
3	Jon M. Kleinberg, Éva Tardos	Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields.	J. ACM	2002	DBLP DOI BibTeX RDF	metric labeling, classification, Approximation algorithms, Markov random fields
3	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo approximation algorithms, with applications to optimal motion planning.	Symposium on Computational Geometry	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
3	Hai Huang, Andréa W. Richa, Michael Segal	Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks.	DIAL-M	2002	DBLP DOI BibTeX RDF	piercing set, clustering, approximation algorithms, mobile ad-hoc networks, distributed protocols
3	Markus Bläser, Bodo Manthey	Two Approximation Algorithms for 3-Cycle Covers.	APPROX	2002	DBLP DOI BibTeX RDF
3	Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar	Approximation Algorithms for the Unsplittable Flow Problem.	APPROX	2002	DBLP DOI BibTeX RDF
3	Alexander A. Ageev	Improved Approximation Algorithms for Multilevel Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
3	Kamal Jain, Vijay V. Vazirani	Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation.	J. ACM	2001	DBLP DOI BibTeX RDF	approximation algorithms, linear programming, Lagrangian relaxation, facility location problem, k-median problem
3	Pierre Fraigniaud	Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.	ESA	2001	DBLP DOI BibTeX RDF	Minimum Degree Spanning Tree, Approximation Algorithms, Multicasting, Broadcasting, Gossiping, Graph and Network Algorithms
3	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan	Approximation Algorithms for Partial Covering Problems.	ICALP	2001	DBLP DOI BibTeX RDF	Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
3	Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti	Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.	ESA	2000	DBLP DOI BibTeX RDF	Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization
3	David B. Shmoys	Approximation algorithms for facility location problems.	APPROX	2000	DBLP DOI BibTeX RDF
3	Moses Charikar	Greedy approximation algorithms for finding dense components in a graph.	APPROX	2000	DBLP DOI BibTeX RDF
3	Sanjeev Arora	Approximation algorithms that take advice.	APPROX	2000	DBLP DOI BibTeX RDF
3	Tobias Polzin, Siavash Vahdati Daneshmand	Primal-dual approaches to the Steiner problem.	APPROX	2000	DBLP DOI BibTeX RDF	dual-ascent, approximation algorithms, lower bound, relaxation, primal-dual, Steiner problem
3	Kamal Jain, Vijay V. Vazirani	Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems.	FOCS	1999	DBLP DOI BibTeX RDF	approximation algorithms, linear programming, facility location, k-median
3	Daya Ram Gaur, Ramesh Krishnamurti	Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.	ISAAC	1999	DBLP DOI BibTeX RDF	hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut
3	David B. Shmoys	Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems.	APPROX	1998	DBLP DOI BibTeX RDF
3	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.	ISAAC	1998	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
3	Anand Srivastav, Katja Wolf	Finding Dense Subgraphs with Semidefinite Programming.	APPROX	1998	DBLP DOI BibTeX RDF	Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming
3	Thomas Jansen	Introduction to the Theory of Complexity and Approximation Algorithms.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
3	Detlef Sieling	Derandomization.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
3	Sridhar Rajagopalan, Vijay V. Vazirani	Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs	FOCS	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
2	Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia	Socially desirable approximations for Dodgson's voting rule.	ACM Conference on Electronic Commerce	2010	DBLP DOI BibTeX RDF	dodgson's voting rule, approximation algorithms, social choice
2	Erik D. Demaine, Morteza Zadimoghaddam	Scheduling to minimize power consumption using submodular functions.	SPAA	2010	DBLP DOI BibTeX RDF	pre-emptive scheduling, sleep state, approximation algorithms, multiprocessor scheduling
2	Imed Kacem	Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Non-availability constraint, Scheduling, Approximation, Makespan
2	Raghu Pasupathy, Bruce W. Schmeiser	Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem.	ACM Trans. Model. Comput. Simul.	2009	DBLP DOI BibTeX RDF	Retrospective approximation, sample-average approximation, stochastic root finding
2	Xujin Chen, Bo Chen	Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.	Algorithmica	2009	DBLP DOI BibTeX RDF	Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee
2	Zhi-Zhong Chen, Lusheng Wang, Zhanyong Wang	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.	Algorithmica	2009	DBLP DOI BibTeX RDF	Duplication models, Approximation algorithms, Tandem repeats
2	Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff	Improved Approximation Algorithms for Label Cover Problems.	ESA	2009	DBLP DOI BibTeX RDF
2	Florian Diedrich, Klaus Jansen	Improved approximation algorithms for scheduling with fixed jobs.	SODA	2009	DBLP DOI BibTeX RDF
2	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.	ICALP	2009	DBLP DOI BibTeX RDF
2	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Near-linear approximation algorithms for geometric hitting sets.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets
2	Timothy M. Chan, Sariel Har-Peled	Approximation algorithms for maximum independent set of pseudo-disks.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation., local search
2	Farzad Hassanzadeh, David Rappaport	Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.	WADS	2009	DBLP DOI BibTeX RDF	Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment
2	Lukasz Kowalik, Marcin Mucha	Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality.	WADS	2009	DBLP DOI BibTeX RDF
2	Harald Räcke, Adi Rosén	Approximation algorithms for time-constrained scheduling on line networks.	SPAA	2009	DBLP DOI BibTeX RDF	line networks, time constraints, packet scheduling
2	Stefanie Jegelka, Suvrit Sra, Arindam Banerjee	Approximation Algorithms for Tensor Clustering.	ALT	2009	DBLP DOI BibTeX RDF
2	Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram	A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.	Algorithmics of Large and Complex Networks	2009	DBLP DOI BibTeX RDF
2	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
2	Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan	Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
2	Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, Hui Xiong	Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System.	DEXA	2009	DBLP DOI BibTeX RDF	Fault Tolerance, Set Cover, Sensor Database
2	Ankur Moitra	Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size.	FOCS	2009	DBLP DOI BibTeX RDF	metric geometry, approximation algorithms, multicommodity flow
2	Zhou Xu, Liang Xu	Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.	ISAAC	2009	DBLP DOI BibTeX RDF	min-max vehicle routing, approximation algorithm, inapproximability, path covers
2	Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy	Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.	ISAAC	2009	DBLP DOI BibTeX RDF
2	Bernd Gärtner, Martin Jaggi	Coresets for polytope distance.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	polytope distance, support vector machines, approximation algorithms, kernel methods, sparsity, geometric optimization, coresets
2	Kasturi R. Varadarajan	Epsilon nets and union complexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation algorithms, set cover, epsilon nets
2	Peng-Jun Wan	Multiflows in multihop wireless networks.	MobiHoc	2009	DBLP DOI BibTeX RDF	approximation algorithms, multicommodity flow, capacity region
2	Saurav Pandit, Sriram V. Pemmaraju	Return of the primal-dual: distributed metric facilitylocation.	PODC	2009	DBLP DOI BibTeX RDF	bounded message size, approximation algorithms, wireless ad-hoc networks, facility location, unit ball graphs
2	Sudipto Guha, Kamesh Munagala	Exceeding expectations and clustering uncertain data.	PODS	2009	DBLP DOI BibTeX RDF	clustering, approximation algorithms
2	Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks	On the complexity of the regenerator placement problem in optical networks.	SPAA	2009	DBLP DOI BibTeX RDF	approximation algorithms, complexity, optical networks, wavelength division multiplexing (wdm), regenerators
2	Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi	Online and stochastic survivable network design.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, online algorithms, network design problems
2	Yuichi Yoshida, Masaki Yamamoto, Hiro Ito	An improved constant-time approximation algorithm for maximum~matchings.	STOC	2009	DBLP DOI BibTeX RDF	constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
2	V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan	A unified approach to scheduling on unrelated parallel machines.	J. ACM	2009	DBLP DOI BibTeX RDF	scheduling under multiple criteria, Approximation algorithms, randomized rounding
2	Matthew Andrews, Lisa Zhang	Complexity of wavelength assignment in optical network optimization.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	approximation algorithms, optical networking, hardness of approximation, routing and wavelength assignment
2	T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan	The Guarding Problem - Complexity and Approximation.	IWOCA	2009	DBLP DOI BibTeX RDF	QBF (Quantified Boolean Formula), QSAT (Quantified Satisfiability), Approximation Algorithms, PSPACE-complete
2	Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi	Minmax Tree Cover in the Euclidean Space.	WALCOM	2009	DBLP DOI BibTeX RDF	Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms
2	Boris Aronov, Paz Carmi, Matthew J. Katz	Minimum-Cost Load-Balancing Partitions.	Algorithmica	2009	DBLP DOI BibTeX RDF	Additive-weighted Voronoi diagram, Fat partitions, Approximation algorithms, Load balancing, Geometric optimization, Fatness
2	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Circuit design, Inapproximability
2	Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees
2	Guang Xu, Jinhui Xu	An improved approximation algorithm for uncapacitated facility location problem with penalties.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Algorithms, Approximation algorithms, Outliers, Facility location problem
2	Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa	Approximation algorithms for connected facility location problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Approximation algorithms, Integer programming, Steiner tree, LP-rounding, Connected facility location
2	Zhi-Zhong Chen	Approximation Algorithms for Bounded Degree Phylogenetic Roots.	Algorithmica	2008	DBLP DOI BibTeX RDF	Phylogenetic roots, Approximation algorithms, Randomized algorithms, Graph algorithms, Computational biology, Phylogenies
2	Jens Maßberg, Jens Vygen	Approximation algorithms for a facility location problem with service capacities.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Approximation algorithm, network design, VLSI design, facility location
2	Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas	Approximation Algorithms for 3D Orthogonal Knapsack.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	geometric configurations, approximation algorithm, computational and structural complexity
2	Klaus Jansen, Hu Zhang	Approximation algorithms for general packing problems and their application to the multicast congestion problem.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68W25, 90C25, 90C05, 68W40, 68M10
2	Sudipto Guha, Boulos Harb	Approximation Algorithms for Wavelet Transform Coding of Data Streams.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Zoltán Király	Better and Simpler Approximation Algorithms for the Stable Marriage Problem.	ESA	2008	DBLP DOI BibTeX RDF	Hospitals/Residents problem, approximation algorithms, stable matching