Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Primal dual based algorithm for degree-balanced spanning tree problem
This paper studies approximation algorithm for the degree-balanced spanning tree (DBST)
problem. Given a graph G=(V, E), the goal is to find a spanning tree T such that∑ v∈ V deg …
problem. Given a graph G=(V, E), the goal is to find a spanning tree T such that∑ v∈ V deg …
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
In this paper, we consider the maximum and minimum versions of degree-concentrated fault-
tolerant spanning subgraph problem which has many applications in network …
tolerant spanning subgraph problem which has many applications in network …
Global Approximation of Local Optimality: Nonsubmodular Optimization
In the study of information technology, one of the important efforts is made on dealing with
nonsubmodular optimizations since there are many such problems raised in various areas …
nonsubmodular optimizations since there are many such problems raised in various areas …
A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
T Okuno, Y Ikebe - Optimization, 2021 - Taylor & Francis
In this paper, we consider a class of mixed integer programming problems (MIPs) whose
objective functions are DC functions, that is, functions representable in terms of a difference …
objective functions are DC functions, that is, functions representable in terms of a difference …
[PDF][PDF] Introduction to Computational Social Networks
A network is also called a graph, consisting of a set of nodes and a set of edges. Each edge
is a pair of nodes, also called a link. There are two types of networks, undirected and …
is a pair of nodes, also called a link. There are two types of networks, undirected and …
Algorithms for the circle packing problem based on mixed-integer DC programming (New Trends of Numerical Optimization in Advanced Information-Oriented Society)
S Masuda, T Okuno, Y Ikebe - 数理解析研究所講究録, 2019 - repository.kulib.kyoto-u.ac.jp
Circle packing problems are a class of packing problems which attempt to pack a given set
of circles into a container with no overlap. In this paper, we focus on the circle packing …
of circles into a container with no overlap. In this paper, we focus on the circle packing …
DC programming approach for mixed-integer nonlinear programming problems (The state-of-the-art optimization technique and future development)
T Okuno, Y Ikebe, K Matsuo - 数理解析研究所講究録, 2017 - repository.kulib.kyoto-u.ac.jp
In this paper, we consider a class of mixed integer programming problems (MIPs) whose
objective functions are DC functions, that is, functions representable in terms of a difference …
objective functions are DC functions, that is, functions representable in terms of a difference …