AI Chat AI Image Generator AI Video Text to Speech

Optimization over Young Diagrams

09/13/2020

∙

by Shmuel Onn, et al.

∙

∙

We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is polynomial time solvable.

research

∙ 08/25/2019

Optimization over Degree Sequences of Graphs

We consider the problem of finding a subgraph of a given graph minimizin...

0 Gabriel Deza, et al. ∙

research

∙ 09/28/2020

Digraph homomorphism problem and weak near unanimity polymorphism

We consider the problem of finding a homomorphism from an input digraph ...

0 Tomas Feder, et al. ∙

research

∙ 03/11/2020

On Degree Sequence Optimization

We consider the problem of finding a subgraph of a given graph which max...

0 Shmuel Onn, et al. ∙

research

∙ 10/27/2016

Anomaly Detection with the Voronoi Diagram Evolutionary Algorithm

This paper presents the Voronoi diagram-based evolutionary algorithm (Vo...

0 Marti Luis, et al. ∙

research

∙ 12/05/2017

Structured Set Matching Networks for One-Shot Part Labeling

Diagrams often depict complex phenomena and serve as a good test bed for...

0 Jonghyun Choi, et al. ∙

research

∙ 12/06/2021

Computing a Link Diagram from its Exterior

A knot is a circle piecewise-linearly embedded into the 3-sphere. The to...

0 Nathan M. Dunfield, et al. ∙

research

∙ 05/03/2023

Hierarchical and Upstream-Downstream Composition of Stock and Flow Models

The growing complexity of decision-making in public health and health ca...

0 Nicholas Meadows, et al. ∙