المؤلفون: Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

المساهمون: Ilan Doron-Arad and Ariel Kulik and Hadas Shachnai

مصطلحات موضوعية: multiple knapsack, cardinality constraint, EPTAS, iterative randomized rounding

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.27

الاتاحة: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.27
https://nbn-resolving.org/urn:nbn:de:0030-drops-210204
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.27

المؤلفون: Ordozgoiti, B., Mahadevan, A., Matakos, A., Gionis, Aristides

المصدر: Data mining and knowledge discovery. 36(2):709-738

مصطلحات موضوعية: Diversification, Quadratic programming, Randomized rounding, Recommender systems, Approximation algorithms, Combinatorial optimization, Cardinality constraints, Data collection, Distance functions, Item relatedness, Minimisation, Penalty term, Searching for informations, Similarity functions

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319160
https://doi.org/10.1007/s10618-021-00811-2

المؤلفون: Barbault, Pierre, Kowalski, Matthieu, Soussen, Charles

المساهمون: Laboratoire des signaux et systèmes (L2S), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), TAckling the Underspecified (TAU), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), ANR-20-CE45-0018,BMWs,Le Bayesien rencontre les Ondelettes dans l'espace et le temps(2020)

المصدر: https://hal.science/hal-04782425 ; 2024.

مصطلحات موضوعية: Bernoulli-Gaussian prior, spike-and-slab prior, maximum a posteriori estimation, randomized rounding, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing

الاتاحة: https://hal.science/hal-04782425
https://hal.science/hal-04782425v1/document
https://hal.science/hal-04782425v1/file/sparse_mmap.pdf

المؤلفون: Cohen, Tomer, Kulik, Ariel, Shachnai, Hadas

المساهمون: Tomer Cohen and Ariel Kulik and Hadas Shachnai

مصطلحات موضوعية: vector multiple knapsack, two-dimensional packing, randomized rounding, approximation algorithms

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.20

الاتاحة: https://doi.org/10.4230/LIPIcs.ISAAC.2023.20
https://nbn-resolving.org/urn:nbn:de:0030-drops-193229
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.20

المؤلفون: Efrem, Christos, Krikidis, Ioannis

المصدر: IEEE Transactions on Wireless Communications, (2023-02-08)

مصطلحات موضوعية: Intelligent reflecting surface, IRS deployment, full-duplex communication, discrete optimization, NP-hardness, linear-programming relaxation, randomized rounding, approximation algorithm

Relation: https://zenodo.org/communities/irida_ucy; https://zenodo.org/communities/cyprus; https://zenodo.org/communities/eu; https://doi.org/10.5281/zenodo.7621329; https://doi.org/10.5281/zenodo.7621330; oai:zenodo.org:7621330

الاتاحة: https://doi.org/10.5281/zenodo.7621330

المؤلفون: Caragiannis, Ioannis, Jiang, Zhile

المساهمون: Saha, Barna, Servedio, Rocco A.

المصدر: Caragiannis , I & Jiang , Z 2023 , Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming . in B Saha & R A Servedio (eds) , STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery, Inc. , Proceedings of the Annual ACM Symposium on Theory of Computing , pp. 710-722 , 55th Annual ACM Symposium on Theory of Computing, STOC 2023 , Orlando , United States , 20/06/2023 . https://doi.org/10.1145/3564246.3585236

مصطلحات موضوعية: Approximate pure Nash equilibrium, cut games, randomized rounding, semidefinite programming

Relation: https://pure.au.dk/portal/en/publications/24dc6c78-6125-47df-bbbf-6ace8bd1a8e7; urn:ISBN:9781450399135

الاتاحة: https://pure.au.dk/portal/en/publications/24dc6c78-6125-47df-bbbf-6ace8bd1a8e7
https://doi.org/10.1145/3564246.3585236
http://www.scopus.com/inward/record.url?scp=85163129294&partnerID=8YFLogxK

المؤلفون: Ordozgoiti, Bruno, Mahadevan, Ananth, Matakos, Antonis, Gionis, Aristides

المساهمون: Department of Computer Science, Algorithmic Data Science

مصطلحات موضوعية: Diversification, Recommender systems, Randomized rounding, Quadratic programming, APPROXIMATION ALGORITHMS, SUCCESSES, NUMBER, Computer and information sciences

وصف الملف: application/pdf

Relation: This research is supported by the Academy of Finland projects AIDA (317085) and MLDB(325117), theERC Advanced Grant REBOUND(834862), the EC H2020 RIA project SoBigData++ (871042), and the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation.; Ordozgoiti , B , Mahadevan , A , Matakos , A & Gionis , A 2022 , ' Provable randomized rounding for minimum-similarity diversification ' , Data Mining and Knowledge Discovery , vol. 36 , pp. 709-738 . https://doi.org/10.1007/s10618-021-00811-2; ORCID: /0000-0001-5401-5716/work/111176210; http://hdl.handle.net/10138/342329; 9c3a0fd2-2824-4321-b196-63e4c5e15223; 000738439600002

الاتاحة: http://hdl.handle.net/10138/342329

المؤلفون: Fairstein, Yaron, Kulik, Ariel, Shachnai, Hadas

المساهمون: Yaron Fairstein and Ariel Kulik and Hadas Shachnai

مصطلحات موضوعية: Sumodular Optimization, Multiple Knapsack, Randomized Rounding, Linear Grouping, Multiple Choice Multiple Knapsack

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.41

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2021.41
https://nbn-resolving.org/urn:nbn:de:0030-drops-146229
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.41

المؤلفون: Hallgren, Sean, Lee, Eunou, Parekh, Ojas

المساهمون: Sean Hallgren and Eunou Lee and Ojas Parekh

مصطلحات موضوعية: approximation algorithm, quantum computing, local Hamiltonian, mean-field theory, randomized rounding

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.59

الاتاحة: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.59
https://nbn-resolving.org/urn:nbn:de:0030-drops-126629
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.59

المؤلفون: Fairstein, Yaron, Kulik, Ariel, Naor, Joseph (Seffi), Raz, Danny, Shachnai, Hadas

المساهمون: Yaron Fairstein and Ariel Kulik and Joseph (Seffi) Naor and Danny Raz and Hadas Shachnai

مصطلحات موضوعية: Sumodular Optimization, Multiple Knapsack, Randomized Rounding

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.44

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2020.44
https://nbn-resolving.org/urn:nbn:de:0030-drops-129107
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.44

المؤلفون: Lamothe, François, Rachelson, Emmanuel, Haït, Alain, Baudoin, Cedric, Dupé, Jean-Baptiste

المساهمون: Centre National d'Études Spatiales - CNES (FRANCE), Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Thales (FRANCE)

مصطلحات موضوعية: Autre, Unsplittable flows, Randomized rounding, Heuristic, Approximation algorithm

وصف الملف: application/pdf

Relation: https://oatao.univ-toulouse.fr/28809/1/Lamothe_28809.pdf; Lamothe, François and Rachelson, Emmanuel and Haït, Alain and Baudoin, Cedric and Dupé, Jean-Baptiste. Randomized rounding algorithms for large scale unsplittable flow problems. (2021) Journal of Heuristics, 27 (6). 1081-1110. ISSN 1381-1231

الاتاحة: https://oatao.univ-toulouse.fr/28809/
https://oatao.univ-toulouse.fr/28809/1/Lamothe_28809.pdf
https://doi.org/10.1007/s10732-021-09478-w

المؤلفون: Teo, Chung-Piaw, Bertsimas, Dimitris

المصدر: Operations Research, 2001 Jul 01. 49(4), 599-608.

URL الوصول: https://www.jstor.org/stable/3088589

المؤلفون: Rafiey, Akbar, Rafiey, Arash, Santos, Thiago

المساهمون: Akbar Rafiey and Arash Rafiey and Thiago Santos

مصطلحات موضوعية: Approximation algorithms, minimum cost homomorphism, randomized rounding

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.91

الاتاحة: https://doi.org/10.4230/LIPIcs.ICALP.2019.91
https://nbn-resolving.org/urn:nbn:de:0030-drops-106678
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.91

المؤلفون: Wenjie Zhang, Guanglin Zhang, Yifeng Zheng, Liwei Yang, Chai Kiat Yeo

المصدر: IEEE Access, Vol 6, Pp 19833-19843 (2018)

مصطلحات موضوعية: Spectrum sharing, heterogeneous systems, TV white spaces, NP-complete, randomized rounding algorithm, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

وصف الملف: electronic resource

Relation: https://ieeexplore.ieee.org/document/8334226/; https://doaj.org/toc/2169-3536

URL الوصول: https://doaj.org/article/d03a437c24a44a4fa02d34ec7d687b40

المؤلفون: Gölz, Paul, Peters, Dominik, Procaccia, Ariel

مصطلحات موضوعية: Randomized apportionment, Computational social choice, Apportionment, Dependent randomized rounding, Recherche opérationnelle

Time: 003

Relation: EC '22: The 23rd ACM Conference on Economics and Computation; ACM - Association for Computing Machinery; New York, NY; elsevier; 2022; UNITED STATES; non; https://basepub.dauphine.psl.eu/handle/123456789/23784; 562; https://hal.archives-ouvertes.fr/hal-03834513

الاتاحة: https://basepub.dauphine.psl.eu/handle/123456789/23784
https://hal.archives-ouvertes.fr/hal-03834513
https://doi.org/10.1145/3490486.3538299

المؤلفون: Kulik, Ariel, Mnich, Matthias, Shachnai, Hadas

مصطلحات موضوعية: approximation algorithms, Bin packing, randomized rounding, vector bin packing, 004: Computer Sciences

Relation: 64th IEEE Annual Symposium on Foundations of Computer Science, (FOCS 2023); https://hdl.handle.net/11420/45282; 2205.12828

الاتاحة: https://hdl.handle.net/11420/45282

المؤلفون: Schulz, Andreas S., Skutella, Martin

مصطلحات موضوعية: 510 Mathematik, approximation algorithm, randomized rounding, LP relaxation, scheduling, online algorithm

وصف الملف: application/pdf; application/octet-stream

Relation: https://depositonce.tu-berlin.de/handle/11303/15932; http://dx.doi.org/10.14279/depositonce-14705

الاتاحة: https://depositonce.tu-berlin.de/handle/11303/15932
https://doi.org/10.14279/depositonce-14705

المؤلفون: Goemans, Michel X., Skutella, Martin

مصطلحات موضوعية: 510 Mathematik, facility location, cooperative games, LP relaxation, randomized rounding, core

وصف الملف: application/pdf; application/octet-stream

Relation: https://depositonce.tu-berlin.de/handle/11303/15930; http://dx.doi.org/10.14279/depositonce-14703

الاتاحة: https://depositonce.tu-berlin.de/handle/11303/15930
https://doi.org/10.14279/depositonce-14703

المؤلفون: Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità

مصطلحات موضوعية: FOS: Computer and information sciences, NETWORK DESIGN, APPROXIMATION ALGORITHMS, General Mathematics, Computer Science - Data Structures and Algorithms, STEINER TREE, Data Structures and Algorithms (cs.DS), CONNECTIVITY AUGMENTATION, ITERATIVE RANDOMIZED ROUNDING, Software, APPROXIMATION ALGORITHMS, CONNECTIVITY AUGMENTATION, ITERATIVE RANDOMIZED ROUNDING, NETWORK DESIGN, STEINER TREE

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::511f379bfd033308a5efd710c968eb2c
https://hdl.handle.net/11565/4053396

المؤلفون: Hong Zhou, Lap Chi Lau

المصدر: STOC

مصطلحات موضوعية: FOS: Computer and information sciences, 0209 industrial biotechnology, Spectral approach, Scope (project management), General Computer Science, Property (programming), Computer science, Rounding, General Mathematics, Approximation algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Network planning and design, 020901 industrial engineering & automation, 010201 computation theory & mathematics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Randomized rounding, Algorithm, Discrepancy theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6594a9637b8ea55bf1d53da1cc7d073
https://doi.org/10.1137/20m1330762