Skip to contents

Falcone, Maurizio [Author]; Ferretti, Roberto [Author]

Semi-lagrangian approximation schemes for Linear and Hamilton-Jacobi Equations

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Philadelphia,PA: SIAM, 2014
Arora, Sanjeev [Author]; Raghavan, Prabhakar [Author]; Rao, Satish [Author]

Approximation schemes for the k-medians and related problems

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Yorktown Heights, NY: IBM Thomas J. Watson Research Center, 1998

Published in: Almadén Research Center: Research report / RJ ; 10111
Kovalyov, Mikhail Y. [Author]; Werner, Frank [Author]

A polynomial approximation scheme for problem F2/rj/Cmax

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Magdeburg: Otto-von-Guerike-Univ., Fak. für Mathematik, 1995

Published in: Otto-von-Guericke-Universität Magdeburg: Preprint / Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg ; 199501
Maack, Marten [Author] ; Jansen, Klaus [Degree supervisor]; Meyer auf der Heide, Friedhelm [Other]; Levin, Asaf [Other]

Approximation Schemes for Machine Scheduling

View online
Schließen

Access

https://d-nb.info/121329469X/34

kostenfrei

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Kiel: Universitätsbibliothek Kiel, 2020
Maack, Marten [Author] ; Jansen, Klaus [Contributor]; Meyer auf der Heide, Friedhelm [Contributor]; Levin, Asaf [Contributor]

Approximation Schemes for Machine Scheduling

View online
Schließen

Links

https://nbn-resolving.org/urn:nbn:de:gbv:8-mods-2020-00215-3

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

MACAU: Open Access Repository of Kiel University, 2019
Feldmann, Andreas Emil [Author]; Saulpic, David [Author] ; Andreas Emil Feldmann and David Saulpic [Contributor]

Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
Skutella, Martin [Author]; Verschae, Jose [Author] ; Martin Skutella and Jose Verschae [Contributor]

A Robust PTAS for the Parallel Machine Covering Problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2009
Buchem, Moritz [Author]; Rohwedder, Lars [Author]; Vredeveld, Tjark [Author]; Wiese, Andreas [Author] ; Moritz Buchem and Lars Rohwedder and Tjark Vredeveld and Andreas Wiese [Contributor]

Additive Approximation Schemes for Load Balancing Problems

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
Pferschy, Ulrich [Author]; Schauer, Joachim [Author]; Thielen, Clemens [Author]

Approximating the product knapsack problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin, Heidelberg: Springer, 2021
Eberle, Franziska [Author]; Megow, Nicole [Author]; Nölke, Lukas [Author]; Simon, Bertrand [Author]; Wiese, Andreas [Author] ; Franziska Eberle and Nicole Megow and Lukas Nölke and Bertrand Simon and Andreas Wiese [Contributor]

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
Bertrand, Nathalie [Author]; Bouyer, Patricia [Author]; Brihaye, Thomas [Author]; Carlier, Pierre [Author] ; Nathalie Bertrand and Patricia Bouyer and Thomas Brihaye and Pierre Carlier [Contributor]

Analysing Decisive Stochastic Processes

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
Datta, Samir [Author]; Kulkarni, Raghav [Author]; Mukherjee, Anish [Author] ; Samir Datta and Raghav Kulkarni and Anish Mukherjee [Contributor]

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
Deppert, Max Amadeus [Author] ; Jansen, Klaus [Contributor]; Chen, Jian-Jia [Contributor]; Sanders, Peter [Contributor]

Algorithms for Scheduling Problems and Integer Programming

View online
Schließen

Links

https://nbn-resolving.org/urn:nbn:de:gbv:8:3-2023-00265-4

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

MACAU: Open Access Repository of Kiel University, 2022
Boros, Endre [Author]; Elbassioni, Khaled [Author]; Fouz, Mahmoud [Author]; Gurvich, Vladimir [Author]; Makino, Kazuhisa [Author]; Manthey, Bodo [Author]

Approximation schemes for stochastic mean payoff games with perfect information and few random positions - [Published: 19 September 2017]

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

2018

Published in: Algorithmica ; Volume 80(2018), Issue 11, pp. 3132-3157
Wiese, Andreas [Author] ; Andreas Wiese [Contributor]

Fixed-Parameter Approximation Schemes for Weighted Flowtime

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
Deppert, Max Amadeus [Author] ; Jansen, Klaus [Degree supervisor]; Chen, Jian-Jia [Other]; Sanders, Peter [Other]

Algorithms for Scheduling Problems and Integer Programming

View online
Schließen

Access

https://d-nb.info/1287708439/34

kostenfrei

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Kiel: Universitätsbibliothek Kiel, 2022
Ehler, Martin [Author]

The construction of nonseparable wavelet Bi-frames and associated approximation schemes

View online
Schließen

Access

https://d-nb.info/986725749/34

kostenfrei

http://archiv.ub.uni-marburg.de/diss/z2007/0693/

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.
Dinev, Atanas [Author]; Weinberg, S. Matthew [Author] ; Atanas Dinev and S. Matthew Weinberg [Contributor]

Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
Doron-Arad, Ilan [Author]; Kulik, Ariel [Author]; Shachnai, Hadas [Author] ; Ilan Doron-Arad and Ariel Kulik and Hadas Shachnai [Contributor]

Budgeted Matroid Maximization: a Parameterized Viewpoint

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Doron-Arad, Ilan [Author]; Kulik, Ariel [Author]; Shachnai, Hadas [Author] ; Ilan Doron-Arad and Ariel Kulik and Hadas Shachnai [Contributor]

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023

You did not find what you were looking for?

Purchase suggestion
Are you missing something you need for your research? If you have any suggestions please share them here.

Interlibrary Loan
Please search and order your favorite title in the Interlibrary Loan Portal.

Search in field:

Recently searched for:

You did not find what you were looking for?

> Year of publication

Year of publication