Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Bazzi, Abbas"'
Autor:
Norouzi-Fard, Ashkan, Bazzi, Abbas, Halabi, Marwa El, Bogunovic, Ilija, Hsieh, Ya-Ping, Cevher, Volkan
We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the str
Externí odkaz:
http://arxiv.org/abs/1611.08574
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these inequalities yield l
Externí odkaz:
http://arxiv.org/abs/1609.03737
Autor:
Bazzi, Abbas, Norouzi-Fard, Ashkan
We show a close connection between structural hardness for $k$-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite structural hardne
Externí odkaz:
http://arxiv.org/abs/1507.01906
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique Games Conje
Externí odkaz:
http://arxiv.org/abs/1503.00753
Autor:
Bazzi, Abbas1 abbas.bazzi@epfl.ch, Fiorini, Samuel2 sfiorini@ulb.ac.be, Pokutta, Sebastian3 sebastian.pokutta@isye.gatech.edu, Svensson, Ola1 ola.svensson@epfl.ch
Publikováno v:
Mathematics of Operations Research. Feb2019, Vol. 44 Issue 1, p147-172. 26p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bazzi, Abbas
Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power, this class of algorithms seems to contain the most favo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9825383613bfc31a4a2195462accf71b
Autor:
Norouzi Fard Ashkan, Bazzi Abbas, El Halabi Marwa, Bogunovic Ilija, Hsieh Ya-Ping, Cevher Volkan
We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fad1aa73d7ea603bef1217305118fea3
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - ��$, assuming the Unique Games Conject
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::264f0fc64c4bdad8849d0d6f946c06eb
Publikováno v:
2015 IEEE 56th Annual Symposium on Foundations of Computer Science; 2015, p1123-1142, 20p