Kitti Varga

collaborators

4 papers

math.OC2023

Newton-type algorithms for inverse optimization II: weighted span objective

Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga

In inverse optimization problems, the goal is to modify the costs in an underlying optimization problem in such a way that a given solution becomes optimal, while the difference be…

math.OC2023

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and $ℓ_{\infty}$ -norm objectives

Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga

In minimum-cost inverse optimization problems, we are given a feasible solution to an underlying optimization problem together with a linear cost function, and the goal is to modif…

math.CO2023

On the rainbow planar Turán number of paths

Ervin Győri, Ryan R. Martin, Addisu Paulos +2

An edge-colored graph is said to contain a rainbow- $F$ if it contains $F$ as a subgraph and every edge of $F$ is a distinct color. The problem of maximizing edges among $n$ -vertex…

math.CO2022

Exact results for generalized extremal problems forbidding an even cycle

Ervin Győri, Zhen He, Zequn Lv +4

We determine the maximum number of copies of $K_{s, s}$ in a $C_{2 s + 2}$ -free $n$ -vertex graph for all integers $s \geq 2$ and sufficiently large $n$ . Moreover, for $s \in {2, 3}$ and…

Newton-type algorithms for inverse optimization II: weighted span objective

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and ℓ∞​-norm objectives

On the rainbow planar Turán number of paths

Exact results for generalized extremal problems forbidding an even cycle

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and $ℓ_{\infty}$ -norm objectives