Results 21 to 30 of about 477,458 (300)
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions [PDF]
ACM Transactions on Algorithms, 2019 On hypergraphs with m hyperedges and n vertices, where p denotes the total size of the hyperedges, we provide the following results: We give an algorithm that runs in \
Kyle Fox, Debmalya Panigrahi, Fred Zhang
openaire +1 more source
Minimum cuts in geometric intersection graphs [PDF]
Computational Geometry, 2021 11 pages, 4 figures; this version corrects a small bug in the proof of Lemma 5.
Cabello, Sergio, Mulzer, Wolfgang
openaire +3 more sources
On the Minimum Cut of Planarizations
Electronic Notes in Discrete Mathematics, 2007 Abstract Every drawing of a non-planar graph G in the plane induces a planarization , i.e., a planar graph obtained by replacing edge crossings with dummy vertices. In this paper, we consider the relationship between the capacity of a minimum st -cut in a graph G and its crossing minimal planarizations. We show that these capacities need not be
Markus Chimani +2 more
openaire +1 more source
Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
Algorithms, 2021 The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems.
Bonfim Amaro Junior +4 more
doaj +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Remote Sensing, 2016 Laser scanning technology plays an important role in forest inventory, as it enables accurate 3D information capturing in a fast and environmentally-friendly manner. The goal of this study is to develop methods for detecting and discriminating individual
Bisheng Yang +3 more
doaj +1 more source
Exploiting planarity in separation routines for the symmetric traveling salesman problem [PDF]
, 2008 At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Adam N. Letchford +5 more
core +1 more source
Journal of Machine Engineering, 2021 This paper presents a study to ensure the minimum value of Ra and Rz, and the maximum value of MRR when external cylindrical grinding by the PSI. The experiments performed according to the orthogonal Taguchi L9 matrix with the input parameters were ...
Dung Hoang Tien +3 more
doaj +1 more source
Aggregate production planning using integrated fuzzy multi-objective optimization with α-cut analysis [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 Aggregate production planning when operating time, costs, customer demand, labor level, and machine capacity are uncertain is studied. This study optimizes the aggregate production plan, yielding the minimum total costs by using an integrated fuzzy ...
Noppasorn Sutthibutr, Navee Chiadamrong
doaj +1 more source
Decorous lower bounds for minimum linear arrangement [PDF]
, 2011 Minimum Linear Arrangement is a classical basic combinatorial optimization problem from the 1960s, which turns out to be extremely challenging in practice.
J. J. Salazar +5 more
core +1 more source