Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W96526881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for the TSP with a parameterized triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized approximability of TSP with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of Steiner trees: changing the terminal set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for TSP with Simple Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13--15, 2006. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter approximation: conceptual framework and approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of polynomial time approximation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parameterized Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / 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: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized approximation of dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Vertex Cover variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confronting hardness using a hybrid approach / rank
 
Normal rank

Latest revision as of 02:07, 4 July 2024

scientific article
Language Label Description Also known as
English
Improved Approximations for Hard Optimization Problems via Problem Instance Classification
scientific article

    Statements

    Improved Approximations for Hard Optimization Problems via Problem Instance Classification (English)
    0 references
    0 references
    0 references
    27 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers