• Pseudopolynomial time number partitioning
    In computer science, pseudopolynomial time number partitioning is a pseudopolynomial time algorithm for solving the partition problem. The problem can...
    5 KB (775 words) - 19:39, 19 November 2020
  • Pseudo-polynomial time
    polynomial time algorithm (polynomial in the number of integers and the number of bits in the largest integer), but it may have a pseudopolynomial time algorithm...
    5 KB (876 words) - 07:57, 4 December 2023
  • Multiway number partitioning
    In computer science, multiway number partitioning is the problem of partitioning a multiset of numbers into a fixed number of subsets, such that the sums...
    32 KB (4,754 words) - 00:54, 26 January 2024
  • Partition problem
    time in general, but may be practically usable in certain cases. Algorithms developed for multiway number partitioning include: The pseudopolynomial time...
    19 KB (2,441 words) - 17:19, 5 August 2024
  • 3-partition problem
    values are polynomial in n, Partition can be solved in polynomial time using the pseudopolynomial time number partitioning algorithm. In the unrestricted-input...
    15 KB (2,260 words) - 11:29, 14 July 2024
  • Subset sum problem (section Exponential time algorithms)
    Faster Pseudopolynomial Time Algorithm for Subset Sum". arXiv:1507.02318 [cs.DS]. Bringmann, Karl (2017). "A near-linear pseudopolynomial time algorithm...
    25 KB (3,792 words) - 14:10, 26 June 2024
  • Strong NP-completeness (section Strong and weak NP-hardness vs. strong and weak polynomial-time algorithms)
    polynomial time algorithm (polynomial in the number of integers and the number of bits in the largest integer), but it may have a pseudopolynomial time algorithm...
    4 KB (642 words) - 19:47, 7 May 2023
  • Fully polynomial-time approximation scheme
    P. L.; Johnson, E. L.; Korte, B. H.; Nemhauser, G. L. (eds.), "A "Pseudopolynomial" Algorithm for Sequencing Jobs to Minimize Total Tardiness**Research...
    35 KB (5,027 words) - 17:46, 28 October 2024
  • Weak NP-completeness (section Strong and weak NP-hardness vs. strong and weak polynomial-time algorithms)
    polynomial time algorithm (polynomial in the number of integers and the number of bits in the largest integer), but it may have a pseudopolynomial time algorithm...
    2 KB (429 words) - 23:56, 28 May 2022
  • Thumbnail for Knapsack problem
    Knapsack problem (category Pseudo-polynomial time algorithms)
    not to W {\displaystyle W} itself. However, since this runtime is pseudopolynomial, this makes the (decision version of the) knapsack problem a weakly...
    47 KB (7,566 words) - 20:16, 24 October 2024
  • Single-machine scheduling (section Start-time-based length)
    pseudopolynomial time algorithms. Cheng, Ding and Lin surveyed several studies of a deterioration effect, where the length of job j scheduled at time...
    19 KB (2,762 words) - 23:30, 22 October 2024
  • Multiple subset sum
    to a unique agent. Both variants are NP-hard. However, there are pseudopolynomial time algorithms for enumerating all Pareto-optimal solutions when there...
    10 KB (1,610 words) - 10:21, 14 September 2024
  • Art gallery problem
    Ajay; Kim, Taejung; Demaine, Erik D.; Sarma, Sanjay E. (2007), "A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems", Proc...
    22 KB (2,530 words) - 09:06, 13 September 2024
  • Efficient approximately fair item allocation (section Algorithms for a small number of agents)
    (1+epsilon)-EF1 and a 1.45 approximation to the max product, in pseudopolynomial time (see increasing price algorithm below). Garg and McGlaughlin present...
    38 KB (5,471 words) - 23:29, 28 July 2024
  • Combinatorial participatory budgeting
    EJR or an FJR budget-allocation can be found in time polynomial in n and B (that is, pseudopolynomial time).: 5.1.1.2  EJR up-to one project (EJR-1) means...
    61 KB (8,322 words) - 16:34, 30 September 2024
  • Agreeable subset
    the balanced partition problem. For any fixed of additive agents, there exists a pseudopolynomial time for this problem; but if the number of agents is...
    11 KB (1,620 words) - 09:29, 22 July 2024