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:
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
Springer Science and Business Media LLC - Tập 59 - Trang 387-408 - 2010
We derive lower bounds on the convergence rate of comparison based or selection based algorithms, improving existing results in the continuous setting, and extending them to non-trivial results in the discrete case. This is achieved by considering the VC-dimension of the level sets of the fitness functions; results are then obtained through the use of the shatter function lemma. In the special cas...... hiện toàn bộ
Group Activity Selection with Few Agent Types
Springer Science and Business Media LLC - Tập 85 - Trang 1111-1155 - 2022
In this paper we establish the complexity map for the Group Activity Selection Problem (GASP), along with two of its prominent variants called sGASP and gGASP, focusing on the case when the number of types of agents is the parameter. In all these problems, one is given a set of agents (each with their own preferences) and a set of activities, and the aim is to assign agents to activities in a way ...... hiện toàn bộ
LZ77 Computation Based on the Run-Length Encoded BWT
Springer Science and Business Media LLC - Tập 80 - Trang 1986-2011 - 2017
Computing the LZ77 factorization is a fundamental task in text compression and indexing, being the size z of this compressed representation closely related to the self-repetitiveness of the text. A long-standing problem is to compute LZ77 using small working space. Considering that
$$\mathcal {O}(z)$$
...... hiện toàn bộ
On Almost Monge All Scores Matrices
Springer Science and Business Media LLC - Tập 81 - Trang 47-68 - 2018
The all scores matrix of a grid graph is a matrix containing the optimal scores of paths from every vertex on the first row of the graph to every vertex on its last row. This matrix is commonly used to solve diverse string comparison problems. All scores matrices have the Monge property, and this was exploited by previous works that used all scores matrices for solving various problems. In this pa...... hiện toàn bộ
Variable Sized Online Interval Coloring with Bandwidth
Springer Science and Business Media LLC - Tập 53 - Trang 385-401 - 2007
We consider online coloring of intervals with bandwidth in a setting where colors have variable capacities. Whenever the algorithm opens a new color, it must choose the capacity for that color and cannot change it later. A set of intervals can be assigned the same color a of capacity C
a
if the sum of bandwidths of intervals at each poin...... hiện toàn bộ
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
Springer Science and Business Media LLC - Tập 85 - Trang 1912-1947 - 2022
An n-vertex graph is equitably k-colorable if there is a proper coloring of its vertices such that each color is used either
$$\left\lfloor n/k\right\rfloor $$
or
$$\left\lceil n/k\right\rceil $$
...... hiện toàn bộ
Contracting Graphs to Paths and Trees
Springer Science and Business Media LLC - Tập 68 Số 1 - Trang 109-132 - 2014
Ham-Sandwich Cuts for Abstract Order Types
Springer Science and Business Media LLC - Tập 80 - Trang 234-257 - 2016
The linear-time ham-sandwich cut algorithm of Lo, Matoušek, and Steiger for bi-chromatic finite point sets in the plane works by appropriately selecting crossings of the lines in the dual line arrangement with a set of well-chosen vertical lines. We consider the setting where we are not given the coordinates of the point set, but only the orientation of each point triple (the order type) and give ...... hiện toàn bộ
2-Xor Revisited: Satisfiability and Probabilities of Functions
Springer Science and Business Media LLC - Tập 76 - Trang 1035-1076 - 2016
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses
$$x \oplus y$$
, is satisfiable. We revisit this classical problem by giving an alternative, explicit expression of this probability. We the...... hiện toàn bộ
Tổng số: 2,408
- 1
- 2
- 3
- 4
- 5
- 6
- 10