scholarly journals Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares” [Theor. Comput. Sci. 769 (2019) 63–74]

2020 ◽  
Vol 806 ◽  
pp. 632-640
Author(s):  
Sanjib Sadhu ◽  
Xiaozhou He ◽  
Sasanka Roy ◽  
Subhas C. Nandy ◽  
Suchismita Roy
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Line Segments ◽  
Axis Parallel

scholarly journals Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares

2019 ◽  
Vol 769 ◽  
pp. 63-74 ◽  
Author(s):  
Sanjib Sadhu ◽  
Sasanka Roy ◽  
Subhas C. Nandy ◽  
Suchismita Roy
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Line Segments ◽  
Axis Parallel

scholarly journals Minimum Cell Connection in Line Segment Arrangements

2017 ◽  
Vol 27 (03) ◽  
pp. 159-176
Author(s):  
Helmut Alt ◽  
Sergio Cabello ◽  
Panos Giannopoulos ◽  
Christian Knauer
Keyword(s):  
Linear Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Constant Number ◽  
Line Segments ◽  
Straight Line ◽  
Minimum Number ◽  
Number Of Segments ◽  
Connection Problems

We study the complexity of the following cell connection problems in segment arrangements. Given a set of straight-line segments in the plane and two points [Formula: see text] and [Formula: see text] in different cells of the induced arrangement: [(i)] compute the minimum number of segments one needs to remove so that there is a path connecting [Formula: see text] to [Formula: see text] that does not intersect any of the remaining segments; [(ii)] compute the minimum number of segments one needs to remove so that the arrangement induced by the remaining segments has a single cell. We show that problems (i) and (ii) are NP-hard and discuss some special, tractable cases. Most notably, we provide a near-linear-time algorithm for a variant of problem (i) where the path connecting [Formula: see text] to [Formula: see text] must stay inside a given polygon [Formula: see text] with a constant number of holes, the segments are contained in [Formula: see text], and the endpoints of the segments are on the boundary of [Formula: see text]. The approach for this latter result uses homotopy of paths to group the segments into clusters with the property that either all segments in a cluster or none participate in an optimal solution.

Approximating Convex Polyhedra with Axis-Parallel Boxes

1997 ◽  
Vol 07 (03) ◽  
pp. 253-267 ◽  
Author(s):  
Binhai Zhu
Keyword(s):  
Hausdorff Distance ◽  
Convex Polyhedron ◽  
Linear Time ◽  
Time Algorithm ◽  
Convex Polyhedra ◽  
Linear Time Algorithm ◽  
Brute Force ◽  
Axis Parallel ◽  
The Given ◽  
Fixed Center

In this paper, we present an O(n4 log 2n) time algorithm to compute an approximate discrete axis-parallel box of a given n-vertex convex polyhedron P such that the given polyhedron is minimized. Here, "discrete" means that each plane containing a face of the approximate box passes through a vertex of P (or, more generally, passes through a point of a set of given points). This algorithm is significantly faster than the brute force O(n7) time solution for computing the optimal approximate axis-parallel box A* of P such that the symmetric difference of the volume between P and A* is minimized. We present a linear time algorithm to compute a pseudo-optimal (with factor [Formula: see text] approximate axis-parallel box of a convex polyhedron under the Hausdorff distance criterion. We also present O(n) and O(n7 log n) time algorithms to compute the optimal approximate ball, with or without a fixed center, of a convex polyhedron under the Hausdorff distance criterion.

scholarly journals Convex Grid Drawings of 3-Connected Planar Graphs

1997 ◽  
Vol 07 (03) ◽  
pp. 211-223 ◽  
Author(s):  
Marek Chrobak ◽  
Goos Kant
Keyword(s):  
Planar Graphs ◽  
Linear Time ◽  
Time Algorithm ◽  
Plane Graph ◽  
Linear Time Algorithm ◽  
Convex Polygons ◽  
Line Segments ◽  
Polynomial Size ◽  
Straight Line

We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. We present a linear-time algorithm which, given an n-vertex 3-connected plane G (with n ≥ 3), finds such a straight-line convex embedding of G into a (n - 2) × (n - 2) grid.

scholarly journals Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 293
Author(s):  
Xinyue Liu ◽  
Huiqin Jiang ◽  
Pu Wu ◽  
Zehui Shao
Keyword(s):  
Linear Time ◽  
Minimum Weight ◽  
Domination Number ◽  
Time Algorithm ◽  
Simple Graph ◽  
Linear Time Algorithm ◽  
Domination Problem ◽  
Np Complete ◽  
Chordal Bipartite Graphs ◽  
Dominating Function

For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v)≠0 has a neighbor u with f(u)≠0 for every vertex v∈V(G). The weight of a TR3DF f is the sum f(V)=∑v∈V(G)f(v) and the minimum weight of a total Roman {3}-dominating function on G is called the total Roman {3}-domination number denoted by γt{R3}(G). In this paper, we show that the total Roman {3}-domination problem is NP-complete for planar graphs and chordal bipartite graphs. Finally, we present a linear-time algorithm to compute the value of γt{R3} for trees.

A Linear time algorithm for deciding security

1976 ◽  
Author(s):  
A. K. Jones ◽  
R. J. Lipton ◽  
L. Snyder
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm

AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

2000 ◽  
Vol 11 (03) ◽  
pp. 365-371 ◽  
Author(s):  
LJUBOMIR PERKOVIĆ ◽  
BRUCE REED
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Tree Decomposition ◽  
Linear Time Algorithm ◽  
Input Graph ◽  
Primary Motivation ◽  
Small Width ◽  
Tree Decompositions ◽  
Improved Algorithm

We present a modification of Bodlaender's linear time algorithm that, for constant k, determine whether an input graph G has treewidth k and, if so, constructs a tree decomposition of G of width at most k. Our algorithm has the following additional feature: if G has treewidth greater than k then a subgraph G′ of G of treewidth greater than k is returned along with a tree decomposition of G′ of width at most 2k. A consequence is that the fundamental disjoint rooted paths problem can now be solved in O(n2) time. This is the primary motivation of this paper.

Sign in / Sign up

Export Citation Format

Share Document