Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Gruia Calinescu"'
Autor:
Gruia Calinescu, Cristina G. Fernandes
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 10, Iss 3 (2008)
A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k
Externí odkaz:
https://doaj.org/article/14d69442b72b463b80da6fbf6e1980ab
Publikováno v:
Theoretical Computer Science. :1-18
Access Control Lists (ACLs) are an essential security component in network routers. ACLs can be geometrically modeled as a two-dimensional black and white grid; our interest is in the most efficient way to represent such a grid. The more general prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d52b8dfd992f027dce07a5fd8f284cf
https://doi.org/10.1016/j.tcs.2020.03.014
https://doi.org/10.1016/j.tcs.2020.03.014
Autor:
Gruia Calinescu, Xiaolang Wang
Publikováno v:
Journal of Combinatorial Optimization. 37:889-900
Interactivity is a primary performance measure for distributed interactive applications (DIAs). In a network supporting a DIA, interactivity performance depends on both client-to-server network latencies and inter-server network latencies. An optimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c603f253303819e58c8eefe908e94d3
https://doi.org/10.1007/s10878-018-0326-2
https://doi.org/10.1007/s10878-018-0326-2
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030046927
WAOA
WAOA
Given an undirected graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider two network desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49b171b659a152c59ec8d4b0e0b7a61b
https://doi.org/10.1007/978-3-030-04693-4_9
https://doi.org/10.1007/978-3-030-04693-4_9
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783030046170
AAIM
AAIM
Access Control Lists (ACLs) are an essential security component in network routers. ACLs can be geometrically modeled as a two-dimensional black and white grid; our interest is in the most efficient way to represent such a grid. The more general prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a94f784486206f14e453375087f8f9c7
https://doi.org/10.1007/978-3-030-04618-7_16
https://doi.org/10.1007/978-3-030-04618-7_16
Autor:
Gruia Calinescu
Publikováno v:
Theoretical Computer Science. 562:419-435
In a STACS 2003 paper, Talwar analyzes the overpayment the VCG mechanism incurs for ensuring truthfulness in auctions. Among other results, he studies k-Set Cover (given a universe U and a collection of sets S 1 , S 2 , ? , S m , each having a cost c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::798ce16b6ec76db3e7d04a127675e36a
https://doi.org/10.1016/j.tcs.2014.10.019
https://doi.org/10.1016/j.tcs.2014.10.019
Autor:
Gruia Calinescu, Guoliang Xue, Benjamin Grimmer, Sutep Tongngam, Satyajayant Misra, Weiyi Zhang
Publikováno v:
Journal of Combinatorial Optimization. 31:1280-1297
We consider the problem of Single-Tiered Relay Placement with Basestations, which takes as input a set $$S$$S of sensors and a set $$B$$B of basestations described as points in a normed space $$(M,d)$$(M,d), and real numbers $$0< r\le R$$0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a28915124f4350596c0a6c184b10ee0
https://doi.org/10.1007/s10878-014-9823-0
https://doi.org/10.1007/s10878-014-9823-0
Autor:
Gruia Calinescu
Publikováno v:
Discrete Optimization. 14:17-33
Motivated by applications to wireless sensor networks, we study the following problem. We are given a set S of wireless sensor nodes, given as a multiset of points in a normed space. We seek to place a minimum-size (multi)set Q of wireless relay node
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4540f37721e08f8eda033dacdad3798f
https://doi.org/10.1016/j.disopt.2014.06.002
https://doi.org/10.1016/j.disopt.2014.06.002
Autor:
Minming Li, Gruia Calinescu
Publikováno v:
Algorithmica. 72:1011-1032
We study the following optimization problem. The input is a number $$k$$k and a directed graph with a specified "start" vertex, each of whose vertices may have one "memory bank requirement", an integer. There are $$k$$k "registers", labeled $$1, \ldo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::885edd93288060434f9a57a0a1ab8c11
https://doi.org/10.1007/s00453-014-9888-2
https://doi.org/10.1007/s00453-014-9888-2
Autor:
Gruia Calinescu
Publikováno v:
Journal of Combinatorial Optimization. 31:239-259
Given a directed simple graph $$G=(V,E)$$G=(V,E) and a cost function $$c:E \rightarrow R_+$$c:E?R+, the power of a vertex $$u$$u in a directed spanning subgraph $$H$$H is given by $$p_H(u) = \max _{uv \in E(H)} c(uv)$$pH(u)=maxuv?E(H)c(uv), and corre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49a2ea7a2151f95a277741395b33f45f
https://doi.org/10.1007/s10878-014-9738-9
https://doi.org/10.1007/s10878-014-9738-9