![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Approximating Pareto Set Topology by Cubic Interpolation on Bi-objective Problems
Difficult Pareto set topology refers to multi-objective problems with geometries of the Pareto set such that neighboring optimal solutions in objective space differ in several or all variables in decision spac...
-
Chapter and Conference Paper
Estimating Relevance of Variables for Effective Recombination
Dominance, extensions of dominance, decomposition, and indicator functions are well-known approaches used to design MOEAs. Algorithms based on these approaches have mostly sought to enhance parent selection an...
-
Chapter and Conference Paper
A Fitness Landscape Analysis of Pareto Local Search on Bi-objective Permutation Flowshop Scheduling Problems
We study the difficulty of solving different bi-objective formulations of the permutation flowshop scheduling problem by adopting a fitness landscape analysis perspective. Our main goal is to shed the light on...
-
Chapter and Conference Paper
An Approach for the Local Exploration of Discrete Many Objective Optimization Problems
Multi-objective optimization problems with more than three objectives, which are also termed as many objective optimization problems, play an important role in the decision making process. For such problems, i...
-
Chapter and Conference Paper
Using Parallel Strategies to Speed up Pareto Local Search
Pareto Local Search (PLS) is a basic building block in many state-of-the-art multiobjective combinatorial optimization algorithms. However, the basic PLS requires a long time to find high-quality solutions. In...
-
Chapter and Conference Paper
Radio Network Distributed Algorithms in the Unknown Neighborhood Model
The paper deals with radio network distributed algorithms where initially no information about node degrees is available. We show that the lack of such an information affects the time complexity of existing fu...
-
Chapter and Conference Paper
Local Computation of Nearly Additive Spanners
An (α,β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two nodes u,v, d H
-
Chapter and Conference Paper
Local Maps: New Insights into Mobile Agent Algorithms
We address the problem of computing with mobile agents having small local maps. Several trade-offs concerning the radius of the local maps, the number of agents, the time complexity and the number of agent mov...
-
Chapter and Conference Paper
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n 3/2) edge 3-spanner for it in O(logn) time. This algorithm is then extended into a ...
-
Chapter and Conference Paper
Efficient Distributed Handshake Using Mobile Agents
There is a handshake between two nodes in a network, if the two nodes are communicating with one another in an exclusive mode. In this paper, we give a mobile agent algorithm that allows to decide whether two ...
-
Chapter and Conference Paper
Fast Deterministic Distributed Algorithms for Sparse Spanners
This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanner of o