Springer Science and Business Media LLC
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
Springer Science and Business Media LLC - Tập 5 - Trang 317-326 - 2001
We study the approximability of the weighted edge-dominating set problem.
Although even the unweighted case is NP-Complete, in this case a solution of
size at most twice the minimum can be efficiently computed due to its close
relationship with minimum maximal matching; however, in the weighted case such a
nice relationship is not known to exist. In this paper, after showing that
weighted edge dom...
Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques
Springer Science and Business Media LLC - Tập 17 Số 1 - Trang 74-97 - 2009
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
Springer Science and Business Media LLC - Tập 24 - Trang 397-412 - 2011
We propose a new optimization approach based on DC (Difference of Convex
functions) programming and DCA (DC Algorithm) to the so-called Minimum
M-Dominating Set problem in graphs. This problem is beforehand re-casted as a
polyhedral DC program with the help of exact penalty in DC programming. The
related DCA is original and computer efficient because it consists of solving a
few linear programs an...
Retraction Note: Design of extended dense coding protocol strategy based on combinatorial optimization
Springer Science and Business Media LLC - - 2024
Approximation algorithms for Median Hub Location Problems
Springer Science and Business Media LLC - Tập 38 - Trang 375-401 - 2019
In Hub Location Problems, an input is composed of sets of clients, locations and
a pairs of clients; a solution is a subset of locations to open hubs and an
assignment for each pair of clients to a route starting in the first client,
passing through one or more hubs and ending in the second client. The objective
is to find a solution that minimizes the length of all routes plus the cost of
opening...
Maximum properly colored trees in edge-colored graphs
Springer Science and Business Media LLC - - 2021
An edge-colored graph G is a graph with an edge coloring. We say G is properly
colored if any two adjacent edges of G have distinct colors, and G is rainbow if
any two edges of G have distinct colors. For a vertex $$v \in V(G)$$ , the color
degree $$d_G^{col}(v)$$ of v is the number of distinct colors appearing on edges
incident with v. The minimum color degree $$\delta ^{col}(G)$$ of G is the
min...
Planar graphs with $$\Delta =9$$ are neighbor-distinguishing totally 12-colorable
Springer Science and Business Media LLC - Tập 37 - Trang 1071-1089 - 2018
The neighbor-distinguishing total coloring of a graph G is a proper total
coloring of G using k colors such that any two adjacent vertices have different
sets of colors. It was known that every planar graph G with $$\Delta \ge 10$$ is
neighbor-distinguishing totally $$(\Delta +3)$$-colorable. In this paper, we
extend this result to the case $$\Delta =9$$. Namely, we prove that every planar
graph G...
A rooted-forest partition with uniform vertex demand
Springer Science and Business Media LLC - - 2012
Wide Diameters of Cartesian Product Graphs and Digraphs
Springer Science and Business Media LLC - Tập 8 - Trang 171-181 - 2004
In graph theory and study of fault tolerance and transmission delay of networks,
connectivity and diameter of a graph are two very important parameters and have
been deeply studied by many authors. Wide diameter combining connectivity with
diameter is a more important parameter to measure fault tolerance and efficiency
of parallel processing computer networks and has received much attention in the...
Tổng số: 1,633
- 1
- 2
- 3
- 4
- 5
- 6
- 10