Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Lange, Jan-Hendrik"'
The energy transition in transportation benefits from demand-based models to determine the optimal placement of refueling stations for alternative fuel vehicles such as battery electric trucks. A formulation known as the refueling station location pr
Externí odkaz:
http://arxiv.org/abs/2310.05569
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decompositions is by multicuts, the subsets of those edges that straddle distinc
Externí odkaz:
http://arxiv.org/abs/2202.08068
Autor:
Lange, Jan-Hendrik, Swoboda, Paul
We present a message passing method for 0-1 integer linear programs. Our algorithm is based on a decomposition of the original problem into subproblems that are represented as binary decision diagrams. The resulting Lagrangean dual is solved iterativ
Externí odkaz:
http://arxiv.org/abs/2009.00481
Autor:
Lange, Jan-Hendrik
The NP-hard problem of correlation clustering is to partition a signed graph such that the number of conflicts between the partition and the signature of the graph is minimized. This paper studies graph signatures that allow the optimal partition to
Externí odkaz:
http://arxiv.org/abs/2005.01536
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to verify them. Th
Externí odkaz:
http://arxiv.org/abs/1812.01426
Publikováno v:
In Discrete Optimization February 2023 47
Autor:
Lange, Jan-Hendrik, Andres, Bjoern
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for the special
Externí odkaz:
http://arxiv.org/abs/1706.06822
Autor:
Laude, Emanuel, Lange, Jan-Hendrik, Schüpfer, Jonas, Domokos, Csaba, Leal-Taixé, Laura, Schmidt, Frank R., Andres, Bjoern, Cremers, Daniel
This paper introduces a novel algorithm for transductive inference in higher-order MRFs, where the unary energies are parameterized by a variable classifier. The considered task is posed as a joint optimization problem in the continuous classifier pa
Externí odkaz:
http://arxiv.org/abs/1705.05020
Autor:
Rempfler, Markus, Lange, Jan-Hendrik, Jug, Florian, Blasse, Corinna, Myers, Eugene W., Menze, Bjoern H., Andres, Bjoern
Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task. Jug et al. have proposed a mathematical abstraction of this task, the moral lineage tracing
Externí odkaz:
http://arxiv.org/abs/1702.04111
We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as its popula
Externí odkaz:
http://arxiv.org/abs/1608.08678