Treffer 81 - 100 von 390

81

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
Acharya, Pritam ; Bhore, Sujoy ; Gupta, Aaryan ; et al.

E-Ressource
Zu den Favoriten
82

Improved Hardness of Approximation for Geometric Bin Packing
Ray, Arka ; Sandeep, Sai ; Ray, Arka ; et al.

E-Ressource
Zu den Favoriten
83

On combinatorial approximation algorithms in geometry ; Sur les algorithmes d'approximation combinatoires en géométrie
Jartoux, Bruno ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; École nationale des ponts et chaussées (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel ; et al.
https://pastel.hal.science/tel-02066140 ; Computational Geometry [cs.CG]. Université Paris-Est, 2018. English. ⟨NNT : 2018PESC1078⟩.

Approximation algorithm Combinatorial optimisati... Computational geometry Algorithme d'approximati... Optimisation combinatoir... Géométrie algorithmique...
Dissertation
Zu den Favoriten
84

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
Pilipczuk, Michał ; van Leeuwen, Erik Jan ; Wiese, Andreas

Computer Science - Data... 68W25 (Approximation alg...
Report
Zu den Favoriten
85

Packing cycles in planar and bounded-genus graphs
Schlomberg, Niklas ; Thiele, Hanjo ; Vygen, Jens

Mathematics - Combinator... Computer Science - Discr... Computer Science - Data... Mathematics - Geometric...
Report
Zu den Favoriten
86

Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins
Sharma, Eklavya

Computer Science - Compu... Computer Science - Data...
Report
Zu den Favoriten
88

Approximation Algorithms for Generalized Multidimensional Knapsack
Khan, Arindam ; Sharma, Eklavya ; Sreenivas, K. V. N.

Computer Science - Data... Computer Science - Compu...
Report
Zu den Favoriten
89

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
Du, Wenliang ; Eppstein, David ; Goodrich, Michael T. ; et al.

Computer Science - Data...
Report
Zu den Favoriten
90

Peak Demand Minimization via Sliced Strip Packing
Deppert, Max A. ; Jansen, Klaus ; Khan, Arindam ; et al.

Computer Science - Data...
Report
Zu den Favoriten
91

Dieses Ergebnis kann Gästen nicht angezeigt werden.

92

Geometric Packing under Non-uniform Constraints
Ene, Alina ; Har-Peled, Sariel ; Raichel, Benjamin

Computer Science - Compu...
Report
Zu den Favoriten
93

Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
Chan, Timothy M. ; Har-Peled, Sariel

Computer Science - Compu...
Report
Zu den Favoriten
94

Dieses Ergebnis kann Gästen nicht angezeigt werden.

95

A parameterized approximation scheme for the 2D-Knapsack problem with wide items
Pilipczuk, Michal ; Mari, Mathieu ; Picavet, Timothe

Computer Science - Data...
Report
Zu den Favoriten
96

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
Pilipczuk, Michał ; van Leeuwen, Erik Jan ; Wiese, Andreas
Algorithmica; Jun2020, Vol. 82 Issue 6, p1703-1739, 37p

THAILAND INSTITUTE of Electrical... PLANAR graphs GRAPH algorithms INDEPENDENT sets POLYGONS
Fachzeitschrift
Zu den Favoriten
97

Dieses Ergebnis kann Gästen nicht angezeigt werden.

98

Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams
Bakshi, Ainesh ; Chepurko, Nadiia ; Woodruff, David P.

Computer Science - Data... Computer Science - Compu...
Report
Zu den Favoriten
99

Dieses Ergebnis kann Gästen nicht angezeigt werden.

100

A New Class of Algorithms for Finding Short Vectors in Lattices Lifted from Co-dimension $k$ Codes
Lin, Robert ; Shor, Peter W.

Computer Science - Crypt... Mathematics - Number The...
Report
Zu den Favoriten

Filter