Conferences in DBLP

Approximation Algorithms for Combinatorial Optimization (APPROX) (approx)
1998 (conf/approx/1998)

1. Magnús M. Halldórsson
   Approximations of Independent Sets in Graphs. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:1-13 [Conf]
   
2. David B. Shmoys
   Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:15-32 [Conf]
   
3. Vijay V. Vazirani
   The Steiner Tree Problem and Its Generalizations. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:33-38 [Conf]
   
4. Yossi Azar, Leah Epstein
   Approximation Schemes for Covering and Scheduling on Related Machines. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:39-47 [Conf]
   
5. Reuven Bar-Yehuda
   One for the Price of Two: A Unified Approach for Approximating Covering Problems. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:49-62 [Conf]
   
6. Christoph Baur, Sándor P. Fekete
   Approximation of Geometric Dispersion Problems. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:63-75 [Conf]
   
7. Joseph Cheriyan, Tibor Jordán, Zeev Nutov
   Approximating k-outconnected Subgraph Problems. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:77-88 [Conf]
   
8. Leah Epstein
   Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:89-98 [Conf]
   
9. Dorit S. Hochbaum
   Instant Recognition of Half Integrality and 2-Approximations. [Citation Graph (0, 0)][DBLP]
   APPROX, 1998, pp:99-110 [Conf]
   
10. Dorit S. Hochbaum
    The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:111-122 [Conf]
    
11. Hans Kellerer, Ulrich Pferschy
    A New Fully Polynomial Approximation Scheme for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:123-134 [Conf]
    
12. Guy Kortsarz
    On the Hardness of Approximation Spanners. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:135-146 [Conf]
    
13. Vijay Kumar
    Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:147-158 [Conf]
    
14. Ingo Schiermeyer
    Approximating Maximum Independent Set in k-Clique-Free Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:159-168 [Conf]
    
15. Frits C. R. Spieksma
    Approximating an Interval Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:169-180 [Conf]
    
16. Anand Srivastav, Katja Wolf
    Finding Dense Subgraphs with Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:181-191 [Conf]
    
17. Maxim Sviridenko
    Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:193-199 [Conf]