Výsledky vyhledávání - "polynomial-time algorithm"

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Autor Aziz, Haris, Moulin, Hervé, Sandomirskiy, Fedor

“…We consider fair allocation of indivisible items under additive utilities. We show that there exists a strongly polynomial-time algorithm that always computes…”
Získat plný text

A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians Autor Landau, Zeph, Vazirani, Umesh, Vidick, Thomas

“… of heuristics, none of which is guaranteed to succeed. Here we develop a polynomial time algorithm that provably finds the ground state of any 1D quantum system described by a gapped local Hamiltonian with constant ground-state energy…”
Získat plný text

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes Autor Golin, Mordecai, Harb, Elfarouk

“…Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these…”
Získat plný text

A Polynomial-Time Algorithm for Pliable Index Coding Autor Song, Linqi, Fragouli, Christina

“…In pliable index coding, we consider a server with <inline-formula> <tex-math notation="LaTeX">m </tex-math></inline-formula> messages and <inline-formula>…”
Získat plný text

A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks Autor Weiss, Eyal, Margaliot, Michael

“…Many complex systems in biology, physics, and engineering include a large number of state variables (SVs), and measuring the full state of the system is often…”
Získat plný text

A polynomial-time algorithm for the secure state estimation problem under sparse sensor attacks via state decomposition technique Autor Lu, An-Yang, Yang, Guang-Hong

“…This paper investigates the secure state estimation problem for cyber-physical systems (CPSs) under sparse sensor attacks. In the existing results, the secure…”
Získat plný text

A polynomial-time algorithm for user-based relocation in free-floating car sharing systems Autor Schiffer, Maximilian, Hiermann, Gerhard, Rüdel, Fabian, Walther, Grit

“…•We present a polynomial algorithm for user-based relocation and vehicle dispatching.•We solve instances with 100,000 requests and 10,000 vehicles in less than…”
Získat plný text

A polynomial time algorithm to compute the connected treewidth of a series–parallel graph Autor Mescoff, Guillaume, Paul, Christophe, Thilikos, Dimitrios M.

“…It is well known that the treewidth of a graph G corresponds to the node search number where a team of searchers is pursuing a fugitive that is lazy and…”
Získat plný text

A polynomial-time algorithm for the optimal offer in Single-Area Day-Ahead Electricity Markets: Polynomial-time algorithm for optimal offer Autor Fanzeres, Bruno

“…Efficiently devising optimal offers for Generation Companies (GenCos) in Day-Ahead Electricity Markets is a challenging task. Most solution procedures found in…”
Získat plný text

A polynomial‐time algorithm for simple undirected graph isomorphism Autor He, Jing, Chen, Jinjun, Huang, Guangyan, Cao, Jie, Zhang, Zhiwang, Zheng, Hui, Zhang, Peng, Zarei, Roozbeh, Sansoto, Ferry, Wang, Ruchuan, Ji, Yimu, Fan, Weibei, Xie, Zhijun, Wang, Xiancheng, Guo, Mengjiao, Chi, Chi‐Hung, Souza, Paulo A., Zhang, Jiekui, Li, Youtao, Chen, Xiaojun, Shi, Yong, Green, David, Kersi, Taraporewalla, Van Zundert, André

“…Summary The graph isomorphism problem is to determine two finite graphs that are isomorphic which is not known with a polynomial‐time solution. This paper…”
Získat plný text

A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem Autor Vass, Balazs, Berczi-Kovacs, Erika R., Barabas, Abel, Hajdu, Zsombor Laszlo, Tapolcai, Janos

“…The current best practice in survivable routing is to compute link or node disjoint paths in the network topology graph. It can protect single-point failures;…”
Získat plný text

A Polynomial Time Algorithm for Calculating Fourier-Dedekind Sums Autor Xin, Guoce, Xu, Xinyu

“… That is, we provide a practical polynomial time algorithm for calculating Fourier-Dedekind sums…”
Získat plný text

A polynomial time algorithm for finding a minimum 4-partition of a submodular function Autor Hirayama, Tsuyoshi, Liu, Yuhao, Makino, Kazuhisa, Shi, Ke, Xu, Chao

“… . In this paper, we construct the first polynomial-time algorithm for the minimum 4-partition problem…”
Získat plný text

A polynomial-time algorithm recognizing exact cubes of trees Autor Beaudou, Laurent, Echeverría, Henry, Foucaud, Florent, Jiménez, Andrea, Manuylenko, Nikita, Rachuri, Anirudh

Získat plný text

A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology Autor Xiao, Liyun, Bu, Tian-Ming, Wang, Jiangtao

“…Designing the layout for complex electromechanical products involves the challenging task of automatically laying out cables. This challenge is particularly…”
Získat plný text

A polynomial time algorithm for the triangle packing problem on interval graphs Autor Myung, Young-Soo

“… On the other hand, the TPP can be solved in polynomial time for unit interval graphs. For this reason, it is a well-known open problem to prove whether there exists a polynomial time algorithm solving the TPP on interval graphs…”
Získat plný text

Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs Autor Jain, Anuj, Sahni, Sartaj

“…We develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs…”
Získat plný text

Nondeterministic polynomial time algorithm for estimation of space launch base launch capacity Autor Kurela, Michal, Nogues, Olivier, Alasa, Jean-Frédéric

“…When designing the new space launch bases their maximum launch capacity must be defined. The deterministic evaluation of the launch rate can be performed when…”
Získat plný text

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems Autor Könen, David, Stiglmayr, Michael

“…). It derives an output-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems…”
Získat plný text

A faster strongly polynomial time algorithm for submodular function minimization Autor Orlin, James B.

“…We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O( n 5 EO  + …”
Získat plný text