Conferences in DBLP
Sanjeev Arora Approximation algorithms that take advice. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit S. Hochbaum Instant recognition of polynominal time solvability, half integrality and 2-approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf H. Möhring Scheduling under uncertainty: Optimizing against a randomizing adversary. [Citation Graph (0, 0)][DBLP ] Conf ] David B. Shmoys Approximation algorithms for facility location problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Ageev , Refael Hassin , Maxim Sviridenko An approximation algorithm for MAX DICUT with given sizes of parts. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Oded Regev Maximizing job benefits on-line. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Junichiro Fukuyama Variable length sequencing with two lengths. [Citation Graph (0, 0)][DBLP ] Conf ] Vincenzo Auletta , Ioannis Caragiannis , Christos Kaklamanis , Pino Persiano Randomized path coloring on binary trees. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Caprara , Giuseppe F. Italiano , G. Mohan , Alessandro Panconesi , Aravind Srinivasan Wavelength rerouting in optical networks, or the Venetian routing problem. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar Greedy approximation algorithms for finding dense components in a graph. [Citation Graph (0, 0)][DBLP ] Conf ] Bhaskar DasGupta , Michael A. Palis Online real-time preemptive scheduling of jobs with deadlines. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Leslie Ann Goldberg , Catherine S. Greenhill , Mark Jerrum On the relative complexity of approximate counting problems. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Michael Langberg , Kobbi Nissim On the hardness of approximating N P witnesses. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Henk Meijer Maximum dispersion and geometric maximum weight cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Fleischer , Steven S. Seiden New results for online page replication. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami Inapproximability results for set splitting and satisfiability problems with no mixed clauses. [Citation Graph (0, 0)][DBLP ] Conf ] Refael Hassin , R. Ravi , F. Sibel Salman Approximation algorithms for a capacitated network design problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Vijay V. Vazirani An approximation algorithm for the fault tolerant metric facility location problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Könemann , Goran Konjevod , Ojas Parekh , Amitabh Sinha Improved approximations for tour and tree covers. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kortsarz , Zeev Nutov Approximating node connectivity problems via set covers. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Lorys , Katarzyna E. Paluch Rectangle tiling. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Polzin , Siavash Vahdati Daneshmand Primal-dual approaches to the Steiner problem. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Schindelhauer On the inapproximability of broadcasting time. [Citation Graph (0, 0)][DBLP ] Conf ] Hadas Shachnai , Tami Tamir Polynominal time approximation schemes for class-constrained packing problem. [Citation Graph (0, 0)][DBLP ] Conf ] Rob van Stee , Johannes A. La Poutré Partial servicing of on-line jobs. [Citation Graph (0, 0)][DBLP ] Conf ] Santosh Vempala , Adrian Vetta Factor 4/3 approximations for minimum 2-connected subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] 