Suchergebnisse - purely combinatorial polynomial algorithms

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ ∞ -norm objectives von Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“… In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so …”
Volltext

A network flow approach to a common generalization of Clar and Fries numbers von Bérczi-Kovács, Erika, Frank, András

“… The construction makes it possible to apply any standard cheapest network flow algorithm …”
Volltext

Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees von Duan, Ran, Zhang, Tianyi

“… )\) [Krishnan and Raghavachari, 2001] but the running time is quasi-polynomial. In this paper, we focus on purely combinatorial algorithms and try to bridge the gap between LP …”
Volltext

Dynamic Assignment in Distributed Motion Planning With Local Coordination von Zavlanos, M.M., Pappas, G.J.

“… In particular, in applications such as coverage by mobile sensor networks or multiple target tracking, a great new challenge is the development of motion planning algorithms that dynamically assign …”
Volltext

An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes von Karzanov, Alexander V

“… We develop a strongly polynomial purely combinatorial algorithm to find such a packing …”
Volltext

A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs von Bonnet, Edouard, Escoffier, Bruno, Paschos, Vangelis, Stamoulis, Georgios

“… We study the polynomial approximation of the Maximum Vertex Cover Problem in bipartite graphs by a purely combinatorial algorithm and present a computer assisted analysis of it, that finds the worst …”
Volltext

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs von Pilipczuk, Michał, van Leeuwen, Erik Jan, Wiese, Andreas

“… We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph G and a family D of objects , each …”
Volltext

A combinatorial algorithm for the planar multiflow problem with demands located on three holes von Babenko, Maxim A, Karzanov, Alexander V

“… We develop a purely combinatorial strongly polynomial solution algorithm …”
Volltext

Tractable Algorithms for Robust Model Estimation von Enqvist, Olof, Ask, Erik, Kahl, Fredrik, Åström, Kalle

“… In a similar vein, it is also shown how to transform a multi-model estimation problem into a purely combinatorial one …”
Volltext

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials von Hojny, Christopher, Pfetsch, Marc E, Walter, Matthias

“… ). We also present an algorithm that finds these extra monomials for a given polynomial to yield an integral relaxation polytope or determines that no such set of extra monomials exists …”
Volltext

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ∞-norm objectives: Newton-type algorithms for inverse optimization von Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“… In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so …”
Volltext

A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results—A Survey von Faragó, András

“… A fascinating feature of this result is that even though it is a purely probabilistic statement, it provides a valuable and versatile tool for proving completely deterministic theorems …”
Volltext

A new perspective on single-machine scheduling problems with late work related criteria von Shabtay, Dvir

“… This paper provides two new perspectives on single-machine scheduling problems in which the objective involves penalties regarding late work. Both of this …”
Volltext

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and \(\ell_\infty\)-norm objectives von Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“… For the weighted bottleneck Hamming distance objective, we present a simple, purely combinatorial …”
Volltext

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives von Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“… In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so …”
Volltext

Fine costs for Euclid's algorithm on polynomials and Farey maps von Berthé, Valérie, Nakada, Hitoshi, Natsui, Rie, Vallée, Brigitte

“… This paper studies digit-cost functions for the Euclid algorithm on polynomials with coefficients in a finite field, in terms of the number of operations performed on the finite field Fq …”
Volltext

Metric Violation Distance: Hardness and Approximation von Fan, Chenglin, Raichel, Benjamin, Buskirk, Gregory Van

“… Metric data plays an important role in various settings, for example, in metric-based indexing, clustering, classification, and approximation algorithms in general …”
Volltext

An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting von Goaoc, Xavier, Holmsen, Andreas, Nicaud, Cyril

“… \). We show that this question, which is equivalent to deciding the emptiness of certain semi-algebraic sets bounded by cubic polynomials, can be "lifted" to a purely combinatorial problem …”
Volltext

An experimental study of forbidden patterns in geometric permutations by combinatorial lifting von Goaoc, Xavier, Holmsen, Andreas, Nicaud, Cyril

“… , can be ``lifted'' to a purely combinatorial problem. We propose an effective algorithm for that problem, and use it to gain new insights into the structure of geometric permutations …”
Volltext

On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover von Fujito, Toshihiro

Volltext