Treffer 241 - 260 von 80.294

241
242

Improved Approximation Algorithms for the EPR Hamiltonian.
Nathan Ju ; Ansh Nagda
APPROX/RANDOM. :1-9

Konferenz
Zu den Favoriten
243

Efficient and Accurate Approximation Algorithms for Protein Structure Alignment.
Masahito Tsukahara ; Tetsuo Shibuya
ISBRA (1). :122-134

Konferenz
Zu den Favoriten
244

Blackwell's Approachability with Approximation Algorithms.
Dan Garber ; Mhna Massalha
COLT. :2270-2290

Konferenz
Zu den Favoriten
245

On Online Approximation Algorithms for Two-Stage Bins.
Guangwei Wu ; Hongyun He ; Guozhen Rong ; et al.
COCOON (1). :68-80

Konferenz
Zu den Favoriten
246

From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems.
Jianqi Zhou ; Zhongyi Zhang ; Yinghui Wen ; et al.
COCOON (2). :297-310

Konferenz
Zu den Favoriten
247

Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints.
Qinqin Gong ; Chunlin Hao ; Donglei Du ; et al.
COCOON (1). :3-17

Konferenz
Zu den Favoriten
248

Approximation Algorithms for the Maximum Connected Submodular Functions.
Qinqin Gong ; Zixuan Wang ; Yang Lv ; et al.
COCOON (1). :18-31

Konferenz
Zu den Favoriten
250

Approximation Algorithms for Connected Maximum Coverage.
Gianlorenzo D'Angelo ; Esmaeil Delfaraz
AAMAS. :538-546

Konferenz
Zu den Favoriten
251

Approximation Algorithms for Optimal Hopsets.
Michael Dinitz ; Ama Koranteng ; Yasamin Nazari
ICALP. :1-20

Konferenz
Zu den Favoriten
253

Improved Approximation Algorithms for Three-Dimensional Bin Packing.
Debajyoti Kar ; Arindam Khan 0001 ; Malin Rau
ICALP. :1-20

Konferenz
Zu den Favoriten
254

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity.
Ishan Bansal ; Joe Cheriyan ; Sanjeev Khanna ; et al.
ICALP. :1-20

Konferenz
Zu den Favoriten
255

Approximation Algorithms for the Geometric Multimatching Problem.
Shinwoo An ; Eunjin Oh 0001 ; Jie Xue 0003
STOC. :2317-2328

Konferenz
Zu den Favoriten
256

Hardness and Approximation Algorithms for Balanced Districting Problems.
Prathamesh Dharangutte ; Jie Gao 0001 ; Shang-En Huang ; et al.
FORC. :1-24

Konferenz
Zu den Favoriten
257

Improved Approximation Algorithms for Three-Dimensional Knapsack.
Klaus Jansen ; Debajyoti Kar ; Arindam Khan 0001 ; et al.
SoCG. :1-18

Konferenz
Zu den Favoriten
258

Responsible RecSys by Design: Approximation Algorithms for Calibrated Recommendations with Sponsored Items.
Jing Yuan 0002 ; Shaojie Tang 0001 ; Shuzhang Cai ; et al.
ICWSM. :2197-2209

Konferenz
Zu den Favoriten
259

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds.
Guangyi Zhang 0001 ; Ilie Sarpe ; Aristides Gionis
WWW. :3193-3203

Konferenz
Zu den Favoriten
260

Filter