UB FFM: Suchergebnisse - Approximation, randomization and combinatorial optimization

Die Ergebnisse können Gästen nur in Auswahl angezeigt werden. Bitte loggen Sie sich für Vollzugriff ein: Login

1
2
3
4
5
6
7
8
9
10
11
weiter

A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; Approximation, randomization and combinatorial optimization: algorithms and techniques : 11th international workshop, APPROX 2008 and RANDOM 2008
Mittal, S. ; Schulz, A.S.
LECTURE NNOTES IN COMPUTER SCIENCE. (5171):179-192

Konferenz

Prüfe Verfügbarkeit

Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
So, A. M.-C. ; Zhang, J. ; Ye, Y.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):224-235

Konferenz

Prüfe Verfügbarkeit

Non-Adaptive Evaluation of k-of-n Functions:Tight Gap and a Unit-Cost PTAS
Nielsen, Mads Anker ; Rohwedder, Lars ; Schewior, Kevin ; et al.
Nielsen, M A, Rohwedder, L & Schewior, K 2025, Non-Adaptive Evaluation of k-of-n Functions : Tight Gap and a Unit-Cost PTAS. in A Ene & E Chattopadhyay (eds), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, (APPROX/RANDOM 2025)., 26, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 353, 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2025 and the 29th International Conference on Randomization and Computation, RANDOM 2025, Berkeley, United States, 11/08/2025. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.26

adaptivity Approximation scheme Boolean functions sequential testing stochastic combinatorial... stochastic function eval...

Fachzeitschrift

Prüfe Verfügbarkeit

Approximation, Randomization,and Combinatorial Optimization: Algorithms and Techniques: 20th International Workshop, APPROX 2017, and 21st International Workshop, RANDOM 2017, August 16–18, 2017, Berkeley, CA, USA
Jansen, Klaus (Ed.) ; Rolim, Jose (Ed.) ; Williamson, David (Ed.) ; et al.

info:eu-repo/classificat...

Buch

Prüfe Verfügbarkeit

Approximation Algorithms for Graph Homomorphism Problems
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Langberg, M. ; Rabani, Y. ; Swamy, C.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):176-187

Konferenz

Prüfe Verfügbarkeit

Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Levi, R. ; Sviridenko, M.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):188-199

Konferenz

Prüfe Verfügbarkeit

Distance Approximation in Bounded-Degree and General Sparse Graphs
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Marko, S. ; Ron, D.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):475-486

Konferenz

Prüfe Verfügbarkeit

Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Drineas, P. ; Mahoney, M. W. ; Muthukrishnan, S.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):316-326

Konferenz

Prüfe Verfügbarkeit

Adaptive Sampling and Fast Low-Rank Matrix Approximation
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Deshpande, A. ; Vempala, S.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):292-303

Konferenz

Prüfe Verfügbarkeit

Better Approximations for the Minimum Common Integer Partition Problem
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Woodruff, D. P.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):248-259

Konferenz

Prüfe Verfügbarkeit

Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Gandhi, R. ; Mestre, J.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):128-139

Konferenz

Prüfe Verfügbarkeit

An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Chekuri, C. ; Pal, M.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):95-103

Konferenz

Prüfe Verfügbarkeit

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
Approximation algorithms for combinatorial optimization problems; Approximation, randomization and combinatorial optimization: algorithms and techniques
Ambuhl, C. ; Erlebach, T. ; Mihal ak, M. ; et al.
LECTURE NOTES IN COMPUTER SCIENCE. (4110):3-14

Konferenz

Prüfe Verfügbarkeit

Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem
Razip, Hajar ; Zakaria, M. Nordin
2017 IEEE 15th Student Conference on Research and Development (SCOReD) Research and Development (SCOReD), 2017 IEEE 15th Student Conference on. :98-103 Dec, 2017

Konferenz