Výsledky vyhledávání - "68q25: analysis of algorithms AND problems complexity"

NP-hardness of deciding convexity of quartic polynomials and related problems Autor Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of…”
Získat plný text

(Re)packing Equal Disks into Rectangle Autor Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav

“…The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a…”
Získat plný text

Advances on strictly Δ-modular IPs: Advances on strictly Δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta $$\end{document}-modular IPs Autor Nägele, Martin, Nöbel, Christian, Santiago, Richard, Zenklusen, Rico

“…There has been significant work recently on integer programs (IPs) min { c ⊤ x : A x ≤ b , x ∈ Z n } with a constraint marix A with bounded subdeterminants…”
Získat plný text

A linear time algorithm for linearizing quadratic and higher-order shortest path problems: A linear time algorithm for linearizing quadratic Autor Çela, Eranda, Klinz, Bettina, Lendl, Stefan, Woeginger, Gerhard J., Wulf, Lasse

“…An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path…”
Získat plný text

A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows Autor Graf, Lukas, Harks, Tobias

“…Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic concept in dynamic traffic assignment in which individual flow particles myopically select…”
Získat plný text

On the optimality of pseudo-polynomial algorithms for integer programming Autor Fomin, Fedor V., Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket

“…In the classic Integer Programming Feasibility (IPF) problem, the objective is to decide whether, for a given m × n matrix A and an m -vector b = ( b 1 , ⋯ , b…”
Získat plný text

Linear programming using limited-precision oracles Autor Gleixner, Ambros, Steffy, Daniel E.

“…Since the elimination algorithm of Fourier and Motzkin, many different methods have been developed for solving linear programs. When analyzing the time…”
Získat plný text

An Axiomatic Approach to Time-Dependent Shortest Path Oracles Autor Kontogiannis, Spyros, Wagner, Dorothea, Zaroliagis, Christos

“…Computing shortest paths in networks that exhibit a time-dependent metric is a core routine for many applications, with route planning in road networks being a…”
Získat plný text

Graph Isomorphism, Color Refinement, and Compactness Autor Arvind, V., Köbler, Johannes, Rattan, Gaurav, Verbitsky, Oleg

“…Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on…”
Získat plný text

Coordination of a two-level supply chain with contracts Autor Phouratsamay, Siao-Leu, Kedad-Sidhoum, Safia, Pascual, Fanny

“…We consider the coordination of planning decisions of a single product in a supply chain composed of one supplier and one retailer, by using contracts. We…”
Získat plný text

Approximability of average completion time scheduling on unrelated machines Autor Sitters, René

“…We show that minimizing the average job completion time on unrelated machines is APX -hard if preemption of jobs is allowed. This provides one of the last…”
Získat plný text

An efficient polynomial time approximation scheme for load balancing on uniformly related machines Autor Epstein, Leah, Levin, Asaf

“…We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets…”
Získat plný text

The expected bit complexity of the von Neumann rejection algorithm Autor Devroye, Luc, Gravel, Claude

“…In 1952, von Neumann introduced the rejection method for random variate generation. We revisit this algorithm when we have a source of perfect bits at our…”
Získat plný text

The most nonelementary theory Autor Vorobyov, Sergei

“…We give a direct proof by generic reduction that testing validity of formulas in a decidable rudimentary theory Ω of finite typed sets (Henkin, Fundamenta…”
Získat plný text