Search Results - "68Q25: Analysis of algorithms and problem complexity"

NP-hardness of deciding convexity of quartic polynomials and related problems by 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…”
Get full text

(Re)packing Equal Disks into Rectangle by 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…”
Get full text

A linear time algorithm for linearizing quadratic and higher-order shortest path problems: A linear time algorithm for linearizing quadratic by Ç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…”
Get full 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 by 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…”
Get full text

A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows by 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…”
Get full text

On the optimality of pseudo-polynomial algorithms for integer programming by 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…”
Get full text

Linear programming using limited-precision oracles by 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…”
Get full text

An Axiomatic Approach to Time-Dependent Shortest Path Oracles by 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…”
Get full text

Graph Isomorphism, Color Refinement, and Compactness by 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…”
Get full text

Coordination of a two-level supply chain with contracts by 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…”
Get full text

Approximability of average completion time scheduling on unrelated machines by 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…”
Get full text

An efficient polynomial time approximation scheme for load balancing on uniformly related machines by 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…”
Get full text

The expected bit complexity of the von Neumann rejection algorithm by 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…”
Get full text

The most nonelementary theory by 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…”
Get full text