Related papers: Shape Optimization Problems for Metric Graphs
This paper is devoted to the analysis of multiphase shape optimization problems, which can formally be written as $\min\Big\{{g}(F_1(\Omega_1),\dots,F_h(\Omega_h))+ m\vert\,\bigcup_{i=1}^h\Omega_i\vert :\ \Omega_i\subset D,\ \Omega_i\cap…
In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…
In this paper, we address problems related to parameters concerning edge mappings of graphs. Inspired by Ramsey's Theorem, the quantity $m(G, H)$ is defined to be the minimum number $n$ such that for every $f: E(K_n) \rightarrow E(K_n)$…
Working within the class of piecewise constant conductivities, the inverse problem of electrical impedance tomography can be recast as a shape optimization problem where the discontinuity interface is the unknown. Using Gr\"oger's…
In structural optimization, both parameters and shape are relevant for the model performance. Yet, conventional optimization techniques usually consider either parameters or the shape separately. This work addresses this problem by…
This paper details a new algorithm to solve the shortest path problem in valued graphs. Its complexity is $O(D \log v)$ where $D$ is the graph diameter and $v$ its number of vertices. This complexity has to be compared to the one of the…
It is known that, if removing some $n$ edges from a graph $\Gamma$ destroys all subgraphs isomorphic to a given finite graph $K$, then all subgraphs isomorphic to $K$ can be destroyed by removing at most $|E(K)|\cdot n$ edges, which form a…
We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…
The edge domination number $\gamma_e(G)$ of a graph $G$ is the minimum size of a maximal matching in $G$. It is well known that this parameter is computationally very hard, and several approximation algorithms and heuristics have been…
This paper is dedicated to the spectral optimization problem $$ \mathrm{min}\left\{\lambda_1^s(\Omega)+\cdots+\lambda_m^s(\Omega) + \Lambda \mathcal{L}_n(\Omega)\colon \Omega\subset D \mbox{ s-quasi-open}\right\} $$ where $\Lambda>0,…
We prove the (optimal) $W^{1,\infty}$-regularity of weak solutions to the equation $-\Delta u = Q \; \mathcal{H}^{n-1} \llcorner \Gamma$ in a domain $\Omega \subset \mathbb{R}^n$ with Dirichlet boundary conditions, where $\Gamma \subset…
We present some new problems in spectral optimization. The first one consists in determining the best domain for the Dirichlet energy (or for the first eigenvalue) of the {\it metric Laplacian}, and we consider in particular Riemannian or…
We consider spectral optimization problems of the form $$\min\Big\{\lambda_1(\Omega;D):\ \Omega\subset D,\ |\Omega|=1\Big\},$$ where $D$ is a given subset of the Euclidean space $\mathbb{R}^d$. Here $\lambda_1(\Omega;D)$ is the first…
Let $G=(V, E)$ be a given edge-weighted graph and let its {\em realization} $\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e \in E$ independently with probability $p$. In the {\em stochastic matching} problem, the goal…
The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $D,H$ and a positive cost $c_i(u)$ for each $u\in V(D)$ and…
We pursue the study of edge-irregulators of graphs, which were recently introduced in [Fioravantes et al. Parametrised Distance to Local Irregularity. IPEC, 2024]. That is, we are interested in the parameter Ie(G), which, for a given graph…
The parametric global minimum cut problem concerns a graph $G = (V,E)$ where the cost of each edge is an affine function of a parameter $\mu \in \mathbb{R}^d$ for some fixed dimension $d$. We consider the problems of finding the next…
A planar orthogonal drawing {\Gamma} of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and…
We consider shape optimization problems involving functionals depending on perimeter, torsional rigidity and Lebesgue measure. The scaling free cost functionals are of the form $P(\Omega)T^q(\Omega)|\Omega|^{-2q-1/2}$ and the class of…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…