Search results for "APPROX"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ganeshkumar Ganapathy, Tandy J. Warnow	Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees.	APPROX	2002	DBLP DOI BibTeX RDF
1	Benjamin Doerr	Typical Rounding Problems.	APPROX	2002	DBLP DOI BibTeX RDF	games, discrepancy, rounding
1	Markus Bläser, Bodo Manthey	Two Approximation Algorithms for 3-Cycle Covers.	APPROX	2002	DBLP DOI BibTeX RDF
1	Liane Lewin-Eytan, Joseph Naor, Ariel Orda	Routing and Admission Control in Networks with Advance Reservations.	APPROX	2002	DBLP DOI BibTeX RDF
1	Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski	A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.	APPROX	2002	DBLP DOI BibTeX RDF
1	Yuval Rabani	Search and Classification of High Dimensional Data.	APPROX	2002	DBLP DOI BibTeX RDF
1	Uriel Feige, László Lovász 0001, Prasad Tetali	Approximating Min-sum Set Cover.	APPROX	2002	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.	APPROX	2002	DBLP DOI BibTeX RDF
1	Uriel Feige, Eran Ofek, Udi Wieder	Approximating Maximum Edge Coloring in Multigraphs.	APPROX	2002	DBLP DOI BibTeX RDF
1	Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber	Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.	APPROX	2002	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos 0001, Allan Borodin	On the Power of Priority Algorithms for Facility Location and Set Cover.	APPROX	2002	DBLP DOI BibTeX RDF
1	Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie	Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.	APPROX	2002	DBLP DOI BibTeX RDF
1	Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff 0001	Facility Location and the Geometric Minimum-Diameter Spanning Tree.	APPROX	2002	DBLP DOI BibTeX RDF
1	Amit Chakrabarti, Chandra Chekuri, Anupam Gupta 0001, Amit Kumar 0001	Approximation Algorithms for the Unsplittable Flow Problem.	APPROX	2002	DBLP DOI BibTeX RDF
1	Alexander A. Ageev	Improved Approximation Algorithms for Multilevel Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Refael Hassin, Asaf Levin	Minimum Restricted Diameter Spanning Trees.	APPROX	2002	DBLP DOI BibTeX RDF
1	Klaus Jansen, Stefano Leonardi 0001, Vijay V. Vazirani (eds.)	Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings	APPROX	2002	DBLP DOI BibTeX RDF
1	Guy Kortsarz, Robert Krauthgamer, James R. Lee	Hardness of Approximation for Vertex-Connectivity Network-Design Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	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
1	Nitin Ahuja, Anand Srivastav	On Constrained Hypergraph Coloring and Scheduling.	APPROX	2002	DBLP DOI BibTeX RDF
1	Chaitanya Swamy, Amit Kumar 0001	Primal-Dual Algorithms for Connected Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	R. Ravi 0001	Bicriteria Spanning Tree Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Mohammad Mahdian, Yinyu Ye 0001, Jiawei Zhang 0006	Improved Approximation Algorithms for Metric Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Guy Kortsarz, Zeev Nutov	Approximating node connectivity problems via set covers.	APPROX	2000	DBLP DOI BibTeX RDF
1	Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha	Improved approximations for tour and tree covers.	APPROX	2000	DBLP DOI BibTeX RDF
1	Kamal Jain, Vijay V. Vazirani	An approximation algorithm for the fault tolerant metric facility location problem.	APPROX	2000	DBLP DOI BibTeX RDF
1	Alexander A. Ageev, Refael Hassin, Maxim Sviridenko	An approximation algorithm for MAX DICUT with given sizes of parts.	APPROX	2000	DBLP DOI BibTeX RDF
1	Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan	Wavelength rerouting in optical networks, or the Venetian routing problem.	APPROX	2000	DBLP DOI BibTeX RDF
1	Moses Charikar	Greedy approximation algorithms for finding dense components in a graph.	APPROX	2000	DBLP DOI BibTeX RDF
1	Hadas Shachnai, Tami Tamir	Polynominal time approximation schemes for class-constrained packing problem.	APPROX	2000	DBLP DOI BibTeX RDF
1	Sándor P. Fekete, Henk Meijer	Maximum dispersion and geometric maximum weight cliques.	APPROX	2000	DBLP DOI BibTeX RDF
1	Uriel Feige, Michael Langberg, Kobbi Nissim	On the hardness of approximating N P witnesses.	APPROX	2000	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami	Inapproximability results for set splitting and satisfiability problems with no mixed clauses.	APPROX	2000	DBLP DOI BibTeX RDF
1	Rudolf Fleischer, Steven S. Seiden	New results for online page replication.	APPROX	2000	DBLP DOI BibTeX RDF
1	Rolf H. Möhring	Scheduling under uncertainty: Optimizing against a randomizing adversary.	APPROX	2000	DBLP DOI BibTeX RDF
1	Klaus Jansen, Samir Khuller (eds.)	Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings	APPROX	2000	DBLP DOI BibTeX RDF
1	Christian Schindelhauer	On the inapproximability of broadcasting time.	APPROX	2000	DBLP DOI BibTeX RDF
1	Rob van Stee, Johannes A. La Poutré	Partial servicing of on-line jobs.	APPROX	2000	DBLP DOI BibTeX RDF
1	Santosh S. Vempala, Adrian Vetta	Factor 4/3 approximations for minimum 2-connected subgraphs.	APPROX	2000	DBLP DOI BibTeX RDF
1	Bhaskar DasGupta, Michael A. Palis	Online real-time preemptive scheduling of jobs with deadlines.	APPROX	2000	DBLP DOI BibTeX RDF
1	Krzysztof Lorys, Katarzyna E. Paluch 0001	Rectangle tiling.	APPROX	2000	DBLP DOI BibTeX RDF
1	David B. Shmoys	Approximation algorithms for facility location problems.	APPROX	2000	DBLP DOI BibTeX RDF
1	Dorit S. Hochbaum	Instant recognition of polynominal time solvability, half integrality and 2-approximations.	APPROX	2000	DBLP DOI BibTeX RDF
1	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
1	Refael Hassin, R. Ravi 0001, F. Sibel Salman	Approximation algorithms for a capacitated network design problem.	APPROX	2000	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Yossi Azar, Oded Regev 0001	Maximizing job benefits on-line.	APPROX	2000	DBLP DOI BibTeX RDF
1	Piotr Berman, Junichiro Fukuyama	Variable length sequencing with two lengths.	APPROX	2000	DBLP DOI BibTeX RDF
1	Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano	Randomized path coloring on binary trees.	APPROX	2000	DBLP DOI BibTeX RDF
1	Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum	On the relative complexity of approximate counting problems.	APPROX	2000	DBLP DOI BibTeX RDF
1	Sanjeev Arora	Approximation algorithms that take advice.	APPROX	2000	DBLP DOI BibTeX RDF
1	Hans Kellerer, Ulrich Pferschy	A New Fully Polynomial Approximation Scheme for the Knapsack Problem.	APPROX	1998	DBLP DOI BibTeX RDF
1	Dorit S. Hochbaum	The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints.	APPROX	1998	DBLP DOI BibTeX RDF
1	Reuven Bar-Yehuda	One for the Price of Two: A Unified Approach for Approximating Covering Problems.	APPROX	1998	DBLP DOI BibTeX RDF	Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
1	Christoph Baur, Sándor P. Fekete	Approximation of Geometric Dispersion Problems.	APPROX	1998	DBLP DOI BibTeX RDF
1	David B. Shmoys	Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems.	APPROX	1998	DBLP DOI BibTeX RDF
1	Maxim Sviridenko	Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint.	APPROX	1998	DBLP DOI BibTeX RDF
1	Klaus Jansen, Dorit S. Hochbaum (eds.)	Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings	APPROX	1998	DBLP DOI BibTeX RDF
1	Frits C. R. Spieksma	Approximating an Interval Scheduling Problem.	APPROX	1998	DBLP DOI BibTeX RDF
1	Vijay V. Vazirani	The Steiner Tree Problem and Its Generalizations.	APPROX	1998	DBLP DOI BibTeX RDF
1	Dorit S. Hochbaum	Instant Recognition of Half Integrality and 2-Approximations.	APPROX	1998	DBLP DOI BibTeX RDF
1	Yossi Azar, Leah Epstein	Approximation Schemes for Covering and Scheduling on Related Machines.	APPROX	1998	DBLP DOI BibTeX RDF
1	Leah Epstein	Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.	APPROX	1998	DBLP DOI BibTeX RDF
1	Anand Srivastav, Katja Wolf	Finding Dense Subgraphs with Semidefinite Programming.	APPROX	1998	DBLP DOI BibTeX RDF	Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming
1	Magnús M. Halldórsson	Approximations of Independent Sets in Graphs.	APPROX	1998	DBLP DOI BibTeX RDF
1	Guy Kortsarz	On the Hardness of Approximation Spanners.	APPROX	1998	DBLP DOI BibTeX RDF
1	Joseph Cheriyan, Tibor Jordán, Zeev Nutov	Approximating k-outconnected Subgraph Problems.	APPROX	1998	DBLP DOI BibTeX RDF
1	Ingo Schiermeyer	Approximating Maximum Independent Set in k-Clique-Free Graphs.	APPROX	1998	DBLP DOI BibTeX RDF	k-Clique, Algorithm, Complexity, Approximation, Graph, Maximum Independent Set
1	Vijay Kumar	Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks.	APPROX	1998	DBLP DOI BibTeX RDF

Publications at "APPROX"( http://dblp.L3S.de/Venues/APPROX )