Results 21 to 30 of about 460,881 (203)
Alignment and Distribution Is Not (Always) NP-Hard [PDF]
Journal of Parallel and Distributed Computing, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boudet, Vincent +2 more
openaire +5 more sources
The Steiner tree problem on graphs: inapproximability results [PDF]
, 2008 The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset of the vertices (terminals). We show that it is NP-hard to approximate the Steiner tree problem within a factor 96/95.
Chlebikova, Janka +4 more
core +1 more source
Inverse Generalized Maximum Flow Problems
Mathematics, 2019 A natural extension of maximum flow problems is called the generalized maximum flow problem taking into account the gain and loss factors for arcs. This paper investigates an inverse problem corresponding to this problem. It is to increase arc capacities
Javad Tayyebi, Adrian Deaconu
doaj +1 more source
Recognizing weighted and seeded disk graphs
Journal of Computational Geometry, 2022 Disk intersection representations realize graphs by mapping vertices bijectively to disks in the plane such that two disks intersect each other if and only if the corresponding vertices are adjacent in the graph.
Boris Klemz +2 more
doaj +1 more source
NP-Completeness Results for Minimum Planar Spanners [PDF]
Discrete Mathematics & Theoretical Computer Science, 1998 For any fixed parameter t greater or equal to 1, a t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G.
Ulrik Brandes, Dagmar Handke
doaj +2 more sources
International Journal of Dentistry, 2022 This study evaluated the physical and mechanical properties of glass ionomer cement (GIC) associated with 5% hydroxyapatite nanoparticles (NPHAps) and 10% bioactive glass (BAG) 45S5 before and after brushing at different storage times.
Rafael A. Martins +5 more
doaj +1 more source
Journal of Materials Research and Technology, 2023 Metal matrix composites have various structural and thermal applications in terms of their unique mechanical and thermal properties compared to their counterparts.
Jiangbo Tang +8 more
doaj +1 more source
Complexity of approximating bounded variants of optimization problems [PDF]
, 2006 We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional ...
Chlebikova, Janka +3 more
core +1 more source
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +1 more source
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
, 2007 The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +5 more
core +1 more source