Results 41 to 50 of about 408,826 (276)
Extensions of Fractional Precolorings show Discontinuous Behavior [PDF]
, 2012 We study the following problem: given a real number k and integer d, what is the smallest epsilon such that any fractional (k+epsilon)-precoloring of vertices at pairwise distances at least d of a fractionally k-colorable graph can be extended to a ...
Albertson +18 more
core +6 more sources
Approximating Bin Packing within O(log OPT * log log OPT) bins [PDF]
, 2013 For bin packing, the input consists of n items with sizes s_1,...,s_n in [0,1] which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log^2 OPT) bins.
Rothvoss, Thomas
core +1 more source
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We present a simple deterministic distributed algorithm that computes a ($\Delta+1$)-vertex coloring in $O(\text{log}^{2}\Delta. \text{log}\ n)$ rounds. The algorithm can be implemented with $O(\text{log}\ n)$-bit messages.
M. Ghaffari, F. Kuhn
semanticscholar +1 more source
Nonrepetitive colorings of lexicographic product of graphs [PDF]
, 2013 A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\ldots v_{2l}$ for which $c(v_i)=c(v_{l+i})$ for all $1\le i\le l$.
Keszegh, Balázs +2 more
core +3 more sources
TDMA is Optimal for All-unicast DoF Region of TIM if and only if Topology is Chordal Bipartite [PDF]
, 2017 The main result of this work is that an orthogonal access scheme such as TDMA achieves the all-unicast degrees of freedom (DoF) region of the topological interference management (TIM) problem if and only if the network topology graph is chordal bipartite,
Gesbert, David +3 more
core +4 more sources
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces
SIAM Journal on Discrete Mathematics, 2019 We study methods for finding strict upper bounds on the fractional chromatic number $\chi_f(G)$ of a graph $G$.
J. Gimbel +3 more
semanticscholar +1 more source
IEEE Access, 2018 In this paper, we propose a distributed joint computation offloading and resource allocation optimization (JCORAO) scheme in heterogeneous networks with mobile edge computing.
Jing Zhang +3 more
doaj +1 more source
Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks
Entropy, 2019 Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link.
Giuseppe Vettigli +5 more
doaj +1 more source
Structural Properties of Index Coding Capacity Using Fractional Graph Theory [PDF]
, 2015 The capacity region of the index coding problem is characterized through the notion of confusion graph and its fractional chromatic number. Based on this multiletter characterization, several structural properties of the capacity region are established ...
Arbabjolfaei, Fatemeh, Kim, Young-Han
core +1 more source
Stochastic Heat Equation with Multiplicative Fractional-Colored Noise [PDF]
Journal of Theoretical Probability, 2009 We consider the stochastic heat equation with multiplicative noise $u_t={1/2} u+ u \diamond \dot{W}$ in $\bR_{+} \times \bR^d$, where $\diamond$ denotes the Wick product, and the solution is interpreted in the mild sense. The noise $\dot W$ is fractional in time (with Hurst index $H \geq 1/2$), and colored in space (with spatial covariance kernel $f$).
Balan, Raluca, Tudor, Ciprian, A.
openaire +3 more sources