Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st APPROX 1998: Aalborg, Denmark
- Klaus Jansen, Dorit S. Hochbaum:
Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings. Lecture Notes in Computer Science 1444, Springer 1998, ISBN 3-540-64736-8
Invited Talks
- Magnús M. Halldórsson
:
Approximations of Independent Sets in Graphs. 1-13 - David B. Shmoys:
Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. 15-32 - Vijay V. Vazirani:
The Steiner Tree Problem and Its Generalizations. 33-38
Contributed Talks
- Yossi Azar, Leah Epstein:
Approximation Schemes for Covering and Scheduling on Related Machines. 39-47 - Reuven Bar-Yehuda:
One for the Price of Two: A Unified Approach for Approximating Covering Problems. 49-62 - Christoph Baur, Sándor P. Fekete:
Approximation of Geometric Dispersion Problems. 63-75 - Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
Approximating k-outconnected Subgraph Problems. 77-88 - Leah Epstein:
Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. 89-98 - Dorit S. Hochbaum:
Instant Recognition of Half Integrality and 2-Approximations. 99-110 - Dorit S. Hochbaum:
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints. 111-122 - Hans Kellerer, Ulrich Pferschy:
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. 123-134 - Guy Kortsarz:
On the Hardness of Approximation Spanners. 135-146 - Vijay Kumar:
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks. 147-158 - Ingo Schiermeyer:
Approximating Maximum Independent Set in k-Clique-Free Graphs. 159-168 - Frits C. R. Spieksma:
Approximating an Interval Scheduling Problem. 169-180 - Anand Srivastav, Katja Wolf:
Finding Dense Subgraphs with Semidefinite Programming. 181-191 - Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. 193-199
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-03-30 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
