A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in P_7-free and P_8-free chordal graphs
[article]

2019
*
arXiv
*
pre-print

On the

arXiv:1805.02412v2
fatcat:yvlfpi42snbahgvcuoukzgdmj4
*enumeration*of*minimal**dominating**sets*and related notions. ... SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014] the authors give an O(n+m) delay algorithm based on*neighborhood*inclusions*for*the*enumeration*of*minimal**dominating**sets*in split and P_6- ...*Neighborhood*inclusions*for**minimal**dominating**sets**enumeration*all the clauses, and D the associated*set*of vertices in G. By construction D*dominates*all the c i 's. ...##
###
Below all subsets for Minimal Connected Dominating Set
[article]

2016
*
arXiv
*
pre-print

*For*the same ε we also give an algorithm with running time 2^(1-ε)n· n^O(1) to

*enumerate*all

*minimal*connected

*dominating*

*sets*in an input graph G. ... A connected

*dominating*

*set*S is a

*minimal*connected

*dominating*

*set*if no proper subset of S is also a connected

*dominating*

*set*. ... The authors gratefully thank the organizers of the workshop

*Enumeration*Algorithms Using Structure, held in Lorentz Center in Leiden in August 2015, where this work was initiated. ...

##
###
Minimal Roman Dominating Functions: Extensions and Enumeration
[article]

2022
*
arXiv
*
pre-print

Recall that the existence of a similar

arXiv:2204.04765v1
fatcat:cwrkde2ilrdypcscj4e2ethscu
*enumeration*result*for**minimal**dominating**sets*is open*for*decades. ... We develop non-trivial*enumeration*algorithms*for**minimal*Roman*domination*functions with polynomial delay and polynomial space. ... Notice that such a strategy would work not only*for*computing smallest*dominating**sets*, but also*for*computing largest*minimal**dominating**set*, or*for*counting*minimal*solutions, or*for**enumerating*them ...##
###
Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximativ (Dagstuhl Seminar 18421)

2019
*
Dagstuhl Reports
*

*Enumeration*problems require to list all wanted objects of the input as, e.g., particular subsets of the vertex or edge

*set*of a given graph or particular satisfying assignments of logical expressions. ... The main challenge of the area of

*enumeration*problems is that, contrary to decision, optimization and even counting problems, the output length of an

*enumeration*problem is often exponential in the size ... Consider

*for*example the classical concept of

*minimal*

*dominating*

*sets*

*for*graphs. ...

##
###
Distortion Effects in Equal Area Unit Maps

2021
*
KN - Journal of Cartography and Geographic Information
*

Hence,

doi:10.1007/s42489-021-00072-5
fatcat:qtutypmrhfcvhpijwbkrqnnwdm
*for*some map use tasks where small regions are of importance, alternative map types are needed. ... To describe these distortions, a*set*of analytical measures is proposed. But it turns out that the expressiveness of these measures is rather limited. ... Philipp Loose, who programmed the above-mentioned tool*for*generating EAUMs. ...##
###
Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows

2011
*
Electronical Notes in Theoretical Computer Science
*

The performance of the algorithms is tested on a

doi:10.1016/j.entcs.2011.11.022
fatcat:ix2xdcjdrve7hoz6t2vxqjrf24
*set*of medium and larger instances of the problem. ... In this paper, we compare three multi-objective algorithms based on Variable*Neighborhood*Search (VNS) heuristic. ... That is, before conducting the*neighborhood*search, the base solution is randomly picked from the*set*of non-*dominated*solutions*for*which no*neighborhood*search has been performed yet, and one of the ...##
###
Constraint-Based Local Search for Constrained Optimum Paths Problems
[chapter]

2010
*
Lecture Notes in Computer Science
*

The main technical contribution is a connected

doi:10.1007/978-3-642-13520-0_29
fatcat:5sttzdr4yrfxxo7xkl5vszhaei
*neighborhood*based on rooted spanning trees to find high-quality solutions to COP problems. ... This paper proposes a constraint-based local search (CBLS) framework*for*COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. ... Acknowledgments We would like to thank Maria José Blesa Aguilera who has kindly provided some graphs*for*the experimentation. ...##
###
Bi-objective scheduling for re-entrant hybrid flow shop with learning effect and setup times

2017
*
Scientia Iranica. International Journal of Science and Technology
*

Computational results show that the proposed algorithm can obtain an effective and appropriate solution quality

doi:10.24200/sci.2017.4451
fatcat:c3q3332twjcgdfo2chmhd5d6w4
*for*our investigated problem. ... to a priori approach, the*preferences**for*each objective are*set*by the decision-makers and then, one solution satisfying these*preferences*have to be found. ... This problem is solved with a multi-objective GA by using the Lorenz*dominance*relationship. Cho et al. [11] focused on the*minimization*of makespan and total tardiness in a RHFS. ...##
###
Linear separation of connected dominating sets in graphs

2019
*
Ars Mathematica Contemporanea
*

*dominating*

*set*problem. ... A connected

*dominating*

*set*in a graph is a

*dominating*

*set*of vertices that induces a connected subgraph. ... Since G is connected-domishold, it has at most n(n − 2)

*minimal*connected

*dominating*

*sets*, by Lemma 6.4. The

*minimal*connected

*dominating*

*sets*of G can be

*enumerated*as follows. ...

##
###
Linear separation of connected dominating sets in graphs
[article]

2018
*
arXiv
*
pre-print

*dominating*

*set*problem. ... A connected

*dominating*

*set*in a graph is a

*dominating*

*set*of vertices that induces a connected subgraph. ... Acknowledgments The authors are grateful to an anonymous reviewer

*for*insightful suggestions, to Endre Boros, Yves Crama, Vladimir Gurvich, Pinar Heggernes, Haiko Müller, and Vito Vitrih

*for*helpful discussions ...

##
###
Set-based multiobjective fitness landscapes

2011
*
Proceedings of the 13th annual conference on Genetic and evolutionary computation - GECCO '11
*

The aim is to adapt and to enhance the comprehensive design of

doi:10.1145/2001576.2001681
dblp:conf/gecco/VerelLD11
fatcat:ytukkvynt5adrlbysuigizpvn4
*set*-based multiobjective search approaches, motivated by an a priori analysis of the corresponding*set*problem properties. ... Then, we give a general definition of*set*-based multiobjective fitness landscapes. ... A*set**preference*relation is then usually induced over Σ, like the Pareto*dominance*relation extended to solution-*sets*. ...##
###
Enumeration degrees and non-metrizable topology
[article]

2020
*
arXiv
*
pre-print

The

arXiv:1904.04107v2
fatcat:tepbiv3rvzcefeo273wwwbgvui
*enumeration*degrees of*sets*of natural numbers can be identified with the degrees of difficulty of*enumerating**neighborhood*bases of points in a universal second-countable T_0-space (e.g. the ω-power ... Based on these observations, we utilize general topology (particularly non-metrizable topology) to establish a classification theory of*enumeration*degrees of*sets*of natural numbers. ... Therefore, near N N N -quasi-*minimality*is equivalent to N N N -quasi-*minimality*by definition. Now, by Lemma 7.30, if f is not ∅ ′ -computably*dominated*, then f : (ω ω ) co is N N N -quasi-*minimal*. ...##
###
Sequencing and Scheduling in the Sheet Metal Shop
[chapter]

2007
*
Multiprocessor Scheduling, Theory and Applications
*

To select a new tool (from the short list

doi:10.5772/5231
fatcat:lec2ommtjvdsjg6v26cwgbyb74
*for*that bend line), a number of rules are followed: •*minimize*the number of tool profiles to be used*for*producing the part; • maximize common*preference**for*... Since exhaustive*enumeration*requires too much computational time, a*neighborhood*search method is suggested. ... A first problem is the layout outline*for*the placing of the different stations on a press brake,*minimizing*the travel distance*for*the press brake operator. ...##
###
Connecting Terminals and 2-Disjoint Connected Subgraphs
[chapter]

2013
*
Lecture Notes in Computer Science
*

In this paper we prove that there are at most |V \T | |T |−2 · 3 |V \T | 3

doi:10.1007/978-3-642-45043-3_36
fatcat:x3nxk7qiwnairixirowpv75z7m
*minimal*T -connecting*sets*when |T | ≤ n/3 and that these can be*enumerated*within a polynomial factor of this bound. ... This generalizes the algorithm*for**enumerating*all induced paths between a pair of vertices, corresponding to the case |T | = 2. ...*For*example, in the minimum*dominating**set*problem it is obvious that a*dominating**set*of minimum cardinality is also an inclusion*minimal**dominating**set*. ...##
###
Connecting Terminals and 2-Disjoint Connected Subgraphs
[article]

2013
*
arXiv
*
pre-print

In this paper we prove that there are at most |V ∖ T| |T|-2· 3^|V ∖ T|/3

arXiv:1301.2506v1
fatcat:3vseu7u5enelxn35o6tdeglg64
*minimal*T-connecting*sets*when |T| ≤ n/3 and that these can be*enumerated*within a polynomial factor of this bound. ... This generalizes the algorithm*for**enumerating*all induced paths between a pair of vertices, corresponding to the case |T|=2. ...*For*example, in the minimum*dominating**set*problem it is obvious that a*dominating**set*of minimum cardinality is also an inclusion*minimal**dominating**set*. ...
« Previous

*Showing results 1 — 15 out of 8,604 results*