Results 51 to 60 of about 142,780 (319)
Approximation Algorithms for Unit Disk Graphs [PDF]
, 2005 We consider several graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set) relevant to mobile ad hoc networks. We propose two new notions: thickness and density. If the thickness of a unit disk graph is bounded, then the mentioned problems can be solved in polynomial time ...
openaire +3 more sources
Heuristics for Network Coding in Wireless Networks [PDF]
, 2007 Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from
Adjih, Cédric +2 more
core +4 more sources
Bidimensionality and Geometric Graphs
, 2011 In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a ...
Fomin, Fedor V. +2 more
core +2 more sources
Triangles and Girth in Disk Graphs and Transmission Graphs [PDF]
, 2019 Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st|
Kaplan, Haim +5 more
core +3 more sources
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs [PDF]
Discrete & Computational Geometry, 2019 We revisit a classical graph-theoretic problem, the single-source shortest-path (SSSP) problem, in weighted unit-disk graphs. We first propose an exact (and deterministic) algorithm which solves the problem in O(nlog2n)\documentclass[12pt]{minimal ...
Haitao Wang, J. Xue
semanticscholar +1 more source
Comparison of Yield and Quality of Forage in the Intercropping of Rye (Secale cereale L.) and Vetch (Vicia villosa Roth.) under Different Tillage Systems [PDF]
پژوهشهای زراعی ایرانIntroduction Conservation tillage systems are a key component of sustainable agricultural management, significantly contributing to the improvement of soil’s physical, biological, and chemical properties.
T Salavati +3 more
doaj +1 more source
Stabbing line segments with disks: complexity and approximation algorithms [PDF]
, 2017 Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of
Kobylkin, Konstantin
core +1 more source
Performance Evaluation of a Topology Control Algorithm for Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2010 A main design challenge in the area of sensor networks is energy efficiency to prolong the network operable lifetime. Since most of the energy is spent for radio communication, an effective approach for energy conservation is scheduling sleep intervals ...
Nedal Ababneh
doaj +1 more source
Hyperbolic intersection graphs and (quasi)-polynomial time
, 2019 We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$.
Kisfaludi-Bak, Sándor
core +1 more source
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs [PDF]
, 2017 We give algorithms with running time 2^{O({sqrt{k}log{k}})} n^{O(1)} for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains (i) a path on exactly/at least k vertices, (ii) a cycle on exactly k ...
Fomin, Fedor V. +4 more
core +2 more sources