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:  
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
Shivkumar Sabesan, Niranjan Chakravarthy, K. Tsakalis, Pãnos M. Pardalos, Leonidas D. Iasemidis
Retraction Note: Design of extended dense coding protocol strategy based on combinatorial optimization
Springer Science and Business Media LLC - - 2024
Sisi Xia, Mingjing Zeng
Planar graphs with $$\Delta =9$$ are neighbor-distinguishing totally 12-colorable
Springer Science and Business Media LLC - Tập 37 - Trang 1071-1089 - 2018
Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang
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...... hiện toàn bộ
Connected power domination in graphs
Springer Science and Business Media LLC - Tập 38 - Trang 292-315 - 2019
Boris Brimkov, Derek Mikesell, Logan Smith
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from which every vertex in the graph can be observed, following a set of rules for power system monitoring. In this paper, we study the problem of finding a minimum pow...... hiện toàn bộ
Multi-depot vessel routing problem in a direction dependent wavefield
Springer Science and Business Media LLC - - 2014
Michael J. Hirsch, Daniel Schroeder, Alvaro Maggiar, Irina Dolinskaya
Covering tree with stars
Springer Science and Business Media LLC - Tập 29 - Trang 141-152 - 2013
Jan Baumbach, Jiong Guo, Rashid Ibragimov
We study the tree edit distance (TED) problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set $$\mathcal {S}$$ of stars, can we ...... hiện toàn bộ
On judicious partitions of graphs
Springer Science and Business Media LLC - Tập 31 - Trang 1383-1398 - 2015
Muhuo Liu, Baogang Xu
Let $$k, m$$ be positive integers, let $$G$$ be a graph with ...... hiện toàn bộ
Network construction with subgraph connectivity constraints
Springer Science and Business Media LLC - - 2015
Dana Angluin, James Aspnes, Lev Reyzin
A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority
Springer Science and Business Media LLC - Tập 28 - Trang 414-446 - 2012
S. F. Ghannadpour, S. Noori, R. Tavakkoli-Moghaddam
In this paper, a multi-objective vehicle routing and scheduling problem with uncertainty in priority and request of customers is presented. In the proposed model, a set of dynamic requests is received over time, and the planner does not have any information regarding their location and size until they arrive. Moreover, the routing model aims to satisfy different customers according to their specif...... hiện toàn bộ
An LP-based characterization of solvable QAP instances with chess-board and graded structures
Springer Science and Business Media LLC - Tập 45 - Trang 1-23 - 2023
Lucas A. Waddell, Jerry L. Phillips, Tianzhu Liu, Swarup Dhar
The quadratic assignment problem (QAP) is perhaps the most widely studied nonlinear combinatorial optimization problem. It has many applications in various fields, yet has proven to be extremely difficult to solve. This difficulty has motivated researchers to identify special objective function structures that permit an optimal solution to be found efficiently. Previous work has shown that certain...... hiện toàn bộ
Tổng số: 1,633   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10