Search results for "PTAS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
12	Sriram V. Pemmaraju, Rajiv Raman 0001	Approximation Algorithms for the Max-coloring Problem.	ICALP	2005	DBLP DOI BibTeX RDF
12	Michael 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.	WADS	2005	DBLP DOI BibTeX RDF
12	Xin Han, Kazuo Iwama, Guochuan Zhang	Online Removable Square Packing.	WAOA	2005	DBLP DOI BibTeX RDF
12	Yossi Azar, Amir Epstein	Convex programming for scheduling unrelated parallel machines.	STOC	2005	DBLP DOI BibTeX RDF	unrelated parallel machines, scheduling, approximation algorithms, randomized algorithms, convex programming
12	Patrick Briest, Piotr Krysta, Berthold Vöcking	Approximation techniques for utilitarian mechanism design.	STOC	2005	DBLP DOI BibTeX RDF	combinatorial and multi-unit auctions, enumeration techniques, approximation algorithms, mechanism design, primal-dual method
12	Jan Remy, Angelika Steger	Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
12	Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer	Local approximation schemes for ad hoc and sensor networks.	DIALM-POMC	2005	DBLP DOI BibTeX RDF	distributed algorithm, approximation, wireless ad hoc networks, maximum independent set, minimum dominating set
12	Kang Li, Lusheng Wang 0001	An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring.	AAIM	2005	DBLP DOI BibTeX RDF
12	Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich	Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	scheduling, approximation algorithm, makespan, polynomial time approximation scheme, flow shop
12	Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff 0001	Labeling Points with Weights.	Algorithmica	2004	DBLP DOI BibTeX RDF	Sliding labels, GIS, Computational geometry, Combinatorial optimization, Job scheduling, Maximum weight independent set, Label placement, Throughput maximization
12	Nikhil Bansal 0001, Avrim Blum, Shuchi Chawla 0001	Correlation Clustering.	Mach. Learn.	2004	DBLP DOI BibTeX RDF	clustering, approximation algorithm, document classification
12	Nikhil Bansal 0001, Maxim Sviridenko	New approximability and inapproximability results for 2-dimensional Bin Packing.	SODA	2004	DBLP BibTeX RDF
12	Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao	Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.	SODA	2004	DBLP BibTeX RDF
12	Chaitanya Swamy	Correlation Clustering: maximizing agreements via semidefinite programming.	SODA	2004	DBLP BibTeX RDF
12	Yishan Jiao, Jingyi Xu, Ming Li	On the k-Closest Substring and k-Consensus Pattern Problems.	CPM	2004	DBLP DOI BibTeX RDF
12	Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl	Counting in Trees for Free.	ICALP	2004	DBLP DOI BibTeX RDF
12	Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano	Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines.	STACS	2004	DBLP DOI BibTeX RDF
12	Sergio Cabello	Approximation Algorithms for Spreading Points.	WAOA	2004	DBLP DOI BibTeX RDF
12	Yossi Azar, Shai Taub	All-Norm Approximation for Scheduling on Identical Machines.	SWAT	2004	DBLP DOI BibTeX RDF
12	Klaus Jansen, Guochuan Zhang	Maximizing the Number of Packed Rectangles.	SWAT	2004	DBLP DOI BibTeX RDF
12	Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson	Simultaneous Source Location.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
12	Shuguang Li, Guojun Li, Shaoqiang Zhang	Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines.	COCOON	2004	DBLP DOI BibTeX RDF
12	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.	ICALP	2003	DBLP DOI BibTeX RDF
12	Rainer Feldmann, Martin Gairing, Thomas Lücking 0001, Burkhard Monien, Manuel Rode	Nashification and the Coordination Ratio for a Selfish Routing Game.	ICALP	2003	DBLP DOI BibTeX RDF
12	Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos	Completeness in Differential Approximation Classes.	MFCS	2003	DBLP DOI BibTeX RDF
12	Jens Gramm, Jiong Guo, Rolf Niedermeier	On Exact and Approximation Algorithms for Distinguishing Substring Selection.	FCT	2003	DBLP DOI BibTeX RDF
12	Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov	Open Block Scheduling in Optical Communication Networks.	WAOA	2003	DBLP DOI BibTeX RDF
12	Giulia Galbiati, Edoardo Amaldi	On the Approximability of the Minimum Fundamental Cycle Basis Problem.	WAOA	2003	DBLP DOI BibTeX RDF
12	Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen	Multicast time maximization in energy constrained wireless networks.	DIALM-POMC	2003	DBLP DOI BibTeX RDF	Steiner tree packing, multi-hop packet networks, optimization, sensor networks, wireless networks, multicasting, energy saving
12	Jinhui Xu 0001, Yang Yang 0012, Zhiyong Lin	Traveling Salesman Problem of Segments.	COCOON	2003	DBLP DOI BibTeX RDF
12	Srinivas R. Kashyap, Samir Khuller	Algorithms for Non-uniform Size Data Placement on Parallel Disks.	FSTTCS	2003	DBLP DOI BibTeX RDF
12	Gagan Aggarwal, Rajeev Motwani 0001, An Zhu	The load rebalancing problem.	SPAA	2003	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, load balancing
12	Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira	Scheduling split intervals.	SODA	2002	DBLP BibTeX RDF
12	Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev 0001	Temporary tasks assignment resolved.	SODA	2002	DBLP BibTeX RDF
12	Nikhil Bansal 0001, Avrim Blum, Shuchi Chawla 0001	Correlation Clustering.	FOCS	2002	DBLP DOI BibTeX RDF
12	Leah Epstein, Tamir Tassa	Vector Assignment Problems: A General Framework.	ESA	2002	DBLP DOI BibTeX RDF
12	Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger	All-Norm Approximation Algorithms.	SWAT	2002	DBLP DOI BibTeX RDF
12	Nissan Lev-Tov, David Peleg	Exact Algorithms and Approximation Schemes for Base Station Placement Problems.	SWAT	2002	DBLP DOI BibTeX RDF
12	Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski	Approximability of Dense Instances of NEAREST CODEWORD Problem.	SWAT	2002	DBLP DOI BibTeX RDF
12	Mordecai J. Golin, Claire Kenyon, Neal E. Young	Huffman coding with unequal letter costs.	STOC	2002	DBLP DOI BibTeX RDF
12	Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff 0001	Labeling Points with Weights.	ISAAC	2001	DBLP DOI BibTeX RDF
12	Zhe Dang	Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks.	CAV	2001	DBLP DOI BibTeX RDF
12	Adrian Dumitrescu, Joseph S. B. Mitchell	Approximation algorithms for TSP with neighborhoods in the plane.	SODA	2001	DBLP BibTeX RDF	metamorphoses, algorithms, computational geometry, deformation, differential geometry, proofs, adaptive meshing
12	Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim	Private approximation of NP-hard functions.	STOC	2001	DBLP DOI BibTeX RDF
12	Chin Lung Lu, Zheng-Yao Su, Chuan Yi Tang	A New Measure of Edit Distance between Labeled Trees.	COCOON	2001	DBLP DOI BibTeX RDF
12	Norihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto	A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane.	ISAAC	2000	DBLP DOI BibTeX RDF
12	Bin Ma 0002	A Polynominal Time Approximation Scheme for the Closest Substring Problem.	CPM	2000	DBLP DOI BibTeX RDF
12	Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger	An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.	STACS	2000	DBLP DOI BibTeX RDF
12	Binhai Zhu, Chung Keung Poon	Efficient Approximation Algorithms for Multi-label Map Labeling.	ISAAC	1999	DBLP DOI BibTeX RDF
12	Mikael Hammar, Bengt J. Nilsson	Approximation Results for Kinetic Variants of TSP.	ICALP	1999	DBLP DOI BibTeX RDF
12	Liming Cai, David W. Juedes, Iyad A. Kanj	The Inapproximability of Non NP-hard Optimization Problems.	ISAAC	1998	DBLP DOI BibTeX RDF
12	Richard Mayr, Annette Schelten	Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
12	Pierluigi Crescenzi, Luca Trevisan	On Approximation Scheme Preserving Reducability and Its Applications.	FSTTCS	1994	DBLP DOI BibTeX RDF