• Suche: Randomized Approximation and Online Algorithms for Assignment Problems

Treffer 1 - 20 von 169

3

Coupled and k-sided placements: generalizing generalized assignment.
Korupolu, Madhukar ; Meyerson, Adam ; Rajaraman, Rajmohan ; et al.
Mathematical Programming. Dec2015, Vol. 154 Issue 1/2, p493-514. 22p.

DATA libraries CAPACITY management (Com... LINEAR programming ASSIGNMENT problems (Pro... MAXIMA & minima APPROXIMATION algorithms
Fachzeitschrift
Zu den Favoriten
4

On the Competitive Ratio for Online Facility Location
FOTAKIS, Dimitris
Algorithmica. 50(1):1-57

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
5

ONLINE SUBMODULAR WELFARE MAXIMIZATION: GREEDY BEATS 1/2 IN RANDOM ORDER.
KORULA, NITISH ; MIRROKNI, VAHAB ; ZADIMOGHADDAM, MORTEZA
SIAM Journal on Computing. 2018, Vol. 47 Issue 3, p1056-1086. 31p.

PROBLEM solving INTERNET advertising SUBMODULAR functions APPROXIMATION algorithms GREEDY algorithms
Fachzeitschrift
Zu den Favoriten
6

PRIMAL BEATS DUAL ON ONLINE PACKING LPs IN THE RANDOM-ORDER MODEL.
KESSELHEIM, THOMAS ; RADKE, KLAUS ; TÖNNIS, ANDREAS ; et al.
SIAM Journal on Computing. 2018, Vol. 47 Issue 5, p1939-1964. 26p.

LINEAR programming ALGORITHMS SECRETARY problem (Proba...
Fachzeitschrift
Zu den Favoriten
7

Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization.
Candogan, Ozan ; Chen, Chen ; Niazadeh, Rad
Management Science. Jun2024, Vol. 70 Issue 6, p4069-4086. 18p.

DYNAMIC programming REVENUE management MARKETING effectiveness ONLINE social networks MACHINE learning AIRBNB Inc.
Fachzeitschrift
Zu den Favoriten
8

GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS.
POLOCZEK, MATTHIAS ; SCHNITGER, GEORG ; WILLIAMSON, DAVID P. ; et al.
SIAM Journal on Computing. 2017, Vol. 46 Issue 3, p1029-1061. 33p.

APPROXIMATION algorithms GREEDY algorithms SATISFIABILITY (Computer...
Fachzeitschrift
Zu den Favoriten
9

Approximate counting for complex-weighted Boolean constraint satisfaction problems
Yamakami, Tomoyuki
In Information and Computation October 2012 219:17-38

Fachzeitschrift
Zu den Favoriten
10

Approximation and online algorithms for selected network optimization problems
Ochel, Marcel ; Vöcking, Berthold
Aachen : Publikationsserver der RWTH Aachen University VII, 125 S. : graph. Darst. (2013). = Aachen, Techn. Hochsch., Diss., 2013

Online-Algorithmus Competitive analysis Scheduling Optimierung 7. Clean energy OFDMA …
Dissertation
Zu den Favoriten
11

Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Yamakami, Tomoyuki
(journal version) Information and Computation Vol.219, pp.17-38, 2012

Computer Science - Compu... 68Q15, 68Q17, 68W20, 68W...
Report
Zu den Favoriten
12

Primal Beats Dual on Online Packing LPs in the Random-Order Model
Kesselheim, Thomas ; Radke, Klaus ; Tönnis, Andreas ; et al.

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

Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Tomoyuki Yamakami
Lecture Notes in Computer Science ISBN: 9783642183171

FOS: Computer and inform... Constraint satisfaction... Approximation-preserving... 0102 computer and inform... 02 engineering and techn... Computational Complexity... …
Buch
Zu den Favoriten
14

Assignment problems and their application in economics
Abolhassani, Melika ; Hajiaghayi, Mohammad Taghi ; Digital Repository at the University of Maryland ; et al.

streaming algorithm 8. Economic growth bipartite graph 1. No poverty cournot competition 10. No inequality …
Dissertation
Zu den Favoriten
15

Online discovery of similarity mappings
Ghahramani, Z ; Rakhlin, Alexander ; Abernethy, Jacob ; et al.
Proceedings of the 24th International Conference on Machine Learning

E-Ressource
Zu den Favoriten
16

Primal beats dual on online packing LPs in the random-order model
Klaus Radke ; Thomas Kesselheim ; Berthold Vöcking ; et al.
Proceedings of the forty-sixth annual ACM symposium on Theory of computing. :303-312

FOS: Computer and inform... Computer Science - Compu... Computer Science - Data... 0211 other engineering a... Data Structures and Algo... 0102 computer and inform... …
Fachzeitschrift
Zu den Favoriten
17

Dieses Ergebnis kann Gästen nicht angezeigt werden.

18

Scheduling Multicast Transmissions under SINR Constraints.
Erlebach, Thomas ; Grant, Tom
Algorithms for Sensor Systems; 2010, p47-61, 15p

Buch
Zu den Favoriten
19

Scheduling in wireless networks with oblivious power assignments
Fanghänel, Alexander ; Vöcking, Berthold
Aachen : Publikationsserver der RWTH Aachen University X, 101 S. (2011). = Aachen, Techn. Hochsch., Diss., 2010

Online-Algorithmus Informatik Scheduling Approximationsalgorithmu... Funknetz SINR …
Dissertation
Zu den Favoriten
20

Coupled and k-Sided Placements: Generalizing Generalized Assignment
Madhukar R. Korupolu ; Adam Meyerson ; Rajmohan Rajaraman ; et al.
Lecture Notes in Computer Science ISBN: 9783319075563

11. Sustainability 8. Economic growth 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... 01 natural sciences …
Buch
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter