Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Adjiashvili, David"'
Autor:
Wiedemann, Nina, Adjiashvili, David
The ubiquitous expansion and transformation of the energy supply system involves large-scale power infrastructure construction projects. In the view of investments of more than a million dollars per kilometre, planning authorities aim to minimise the
Externí odkaz:
http://arxiv.org/abs/2101.03388
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform fault model. Such a model assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ may fail. While this approach
Externí odkaz:
http://arxiv.org/abs/2009.05382
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (2-ECSS) and the tree augmentation problem (TAP)
Externí odkaz:
http://arxiv.org/abs/1910.13297
Various real-life planning problems require making upfront decisions before all parameters of the problem have been disclosed. An important special case of such problem especially arises in scheduling and staff rostering problems, where a set of task
Externí odkaz:
http://arxiv.org/abs/1703.06074
Autor:
Adjiashvili, David
The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \subseteq V\times V$ disjoint from $E$ called \textit{links}, and a
Externí odkaz:
http://arxiv.org/abs/1607.03791
Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned to the avai
Externí odkaz:
http://arxiv.org/abs/1607.02437
The Firefighter problem and a variant of it, known as Resource Minimization for Fire Containment (RMFC), are natural models for optimal inhibition of harmful spreading processes. Despite considerable progress on several fronts, the approximability of
Externí odkaz:
http://arxiv.org/abs/1601.00271
Traditional compiler optimization theory distinguishes three separate classes of cache miss -- Cold, Conflict and Capacity. Tiling for cache is typically guided by capacity miss counts. Models of cache function have not been effectively used to guide
Externí odkaz:
http://arxiv.org/abs/1511.05585
Autor:
Adjiashvili, David
Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combinatorial optimization to date made the assumption that every resource
Externí odkaz:
http://arxiv.org/abs/1504.05009
Autor:
Adjiashvili, David, Rotbart, Noy
We investigate adjacency labeling schemes for graphs of bounded degree $\Delta = O(1)$. In particular, we present an optimal (up to an additive constant) $\log n + O(1)$ adjacency labeling scheme for bounded degree trees. The latter scheme is derived
Externí odkaz:
http://arxiv.org/abs/1404.0588