Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Shalmoli Gupta"'
We consider the capacitated $$k$$ k -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) $$k$$ k locations (called ce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61c9e72a859e3c9cd77ed881f33a59e1
http://doc.rero.ch/record/332124/files/10107_2014_Article_857.pdf
http://doc.rero.ch/record/332124/files/10107_2014_Article_857.pdf
Autor:
Sambuddha Roy, Yogish Sabharwal, Anamitra R. Choudhury, Venkatesan T. Chakaravarthy, Shalmoli Gupta
Publikováno v:
Journal of Scheduling. 21:313-325
We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ece026a87c116457f6414996c86e6c
https://doi.org/10.1007/s10951-017-0515-3
https://doi.org/10.1007/s10951-017-0515-3
Publikováno v:
Theoretical Computer Science. 555:2-8
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = ( V , E ) , a cost function c : V ? Z + , a partition P 1 , ? , P r of the edge set E, and a parameter k i for each partition P i . The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6312818adf5d1e28315f41e3636aa767
https://doi.org/10.1016/j.tcs.2014.04.006
https://doi.org/10.1016/j.tcs.2014.04.006
Publikováno v:
ICDCS
Compaction plays a crucial role in NoSQL systems to ensure a high overall read throughput. In this work, we formally define compaction as an optimization problem that attempts to minimize disk I/O. We prove this problem to be NPHard. We then propose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eca98ac2752759ca410c5115fe9a625b
https://doi.org/10.1109/icdcs.2015.53
https://doi.org/10.1109/icdcs.2015.53
Publikováno v:
Automata, Languages, and Programming ISBN: 9783662476710
ICALP (1)
ICALP (1)
We consider the problem of maximizing a nonnegative submodular set function \(f:2^{\mathcal {N}} \rightarrow \mathbb {R}^+\) subject to a p-matchoid constraint in the single-pass streaming setting. Previous work in this context has considered streami
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4950d64756e1d316aa951cdc10a3f8c
https://doi.org/10.1007/978-3-662-47672-7_26
https://doi.org/10.1007/978-3-662-47672-7_26
Autor:
Yogish Sabharwal, Sambuddha Roy, Anamitra R. Choudhury, Venkatesan T. Chakaravarthy, Shalmoli Gupta
Publikováno v:
Algorithms-ESA 2014 ISBN: 9783662447765
ESA
ESA
We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35164bf8ff0d76f3c8b1d6e748025d39
https://doi.org/10.1007/978-3-662-44777-2_19
https://doi.org/10.1007/978-3-662-44777-2_19
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783319075563
IPCO
IPCO
We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c1b945e53f124e88b41be9eeb777164
https://doi.org/10.1007/978-3-319-07557-0_5
https://doi.org/10.1007/978-3-319-07557-0_5
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783642360640
WALCOM
WALCOM
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a cost function c: V → ℤ + , a partition P 1, …, P r of the edge set E, and a parameter k i for each partition P i . The g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9be2b7c5041ddc6c5fd8125cd913c273
https://doi.org/10.1007/978-3-642-36065-7_14
https://doi.org/10.1007/978-3-642-36065-7_14