Open problems around exact algorithms (Q2473037): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to count paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite-difference sieve to count paths and cycles by length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular matrix multiplication revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of fixed parameter clique and dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2^{|E|/4}\)-time algorithm for MAX-CUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of \(O(n^ 2)\) problems in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast rectangular matrix multiplication and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The searching over separators strategy to solve some NP-hard problems in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for computing power indices in weighted voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some problems concerning voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Revision as of 16:58, 27 June 2024

scientific article
Language Label Description Also known as
English
Open problems around exact algorithms
scientific article

    Statements

    Open problems around exact algorithms (English)
    0 references
    26 February 2008
    0 references
    combinatorial optimization
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers