Keywords: غیر قابل تصور بودن; Approximation algorithms; Inapproximability; Diameter; Color spanning set;
مقالات ISI غیر قابل تصور بودن (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: غیر قابل تصور بودن; C72; D82; D4; Mechanism design; Truthful mechanisms; Inapproximability; Non-utilitarian problems; Lower bounds;
Keywords: غیر قابل تصور بودن; Graph domination; Total domination; Rainbow domination; 2-domination; Integer domination; Double domination; Split graph; Approximation algorithm; Inapproximability;
Keywords: غیر قابل تصور بودن; Maximum weighted minimal dominating set (WUDS); NP-hard; inapproximability; planar bipartite; split graphs; UDS in regular graphs;
Keywords: غیر قابل تصور بودن; crossing number; computational complexity; approximation; inapproximability;
Keywords: غیر قابل تصور بودن; convex recoloring; hardness; inapproximability; parameterized intractability;
Keywords: غیر قابل تصور بودن; Approximate counting; #P-hard; FPRAS; Inapproximability;
Keywords: غیر قابل تصور بودن; Bipartite graphs; Geodetic convexity; Helly number; Inapproximability; Radon number; Upper bound;
Keywords: غیر قابل تصور بودن; Rectangle escape; Approximation algorithms; Randomized rounding; NP-completeness; Inapproximability;
Keywords: غیر قابل تصور بودن; Art gallery problem; Visibility; Vertex guarding; Constant factor approximation algorithm; Inapproximability; Euclidean shortest path tree;
Keywords: غیر قابل تصور بودن; Virtual network embedding; combinatorial optimization; computational complexity; inapproximability
Keywords: غیر قابل تصور بودن; Monophonic convexity; Bipartite graphs; NP-completeness; Inapproximability; Convexity number; Percolation time
Keywords: غیر قابل تصور بودن; Computational complexity; Lower bound; Inapproximability; Longest antisymmetric path; Directed acyclic graphs;
Keywords: غیر قابل تصور بودن; Approximation algorithms; Weighted Rule Ensemble Classification Reversal problem; Feasibility; NP-completeness; Approximation; Inapproximability
Keywords: غیر قابل تصور بودن; Max min vertex cover; Min independent dominating set; Polynomial approximation; Inapproximability; Parametric complexity
Keywords: غیر قابل تصور بودن; Arc orienteering problem; Orienteering problem; Mixed orienteering problem; Approximation algorithms; Inapproximability;
Keywords: غیر قابل تصور بودن; Approximation algorithms; Inapproximability; Power law graphs; Combinatorial optimization; Dominating set
Keywords: غیر قابل تصور بودن; Round weighting problem; Flow coloring; Bipartite graphs; NP-hardness; Inapproximability
Keywords: غیر قابل تصور بودن; Combinatorial problems; Inapproximability; Cascading failures; Deterministic threshold model;
Keywords: غیر قابل تصور بودن; Convex recoloring; Complexity; Inapproximability; Linear-time algorithm; Grid graph; (q,q−4)(q,q−4)-graph
Keywords: غیر قابل تصور بودن; Minimum cut; Inapproximability; Connectivity preserving;
Keywords: غیر قابل تصور بودن; Stochastic combinatorial optimization; Stochastic vehicle routing; Computational complexity; Inapproximability
Keywords: غیر قابل تصور بودن; Bipartite graph; Chordal graph; Graph algorithm; Inapproximability; Planar graph; Regular induced subgraph; Treewidth
Keywords: غیر قابل تصور بودن; House-swapping; Inapproximability; Fixed-parameter tractability
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability
Keywords: غیر قابل تصور بودن; Latin hypercube design; Maximin design; NP-completeness; Inapproximability;
Stable matchings of teachers to schools
Keywords: غیر قابل تصور بودن; Stable matchings; Serial dictatorship; NP-completeness; Polynomial-time algorithm; Inapproximability;
Approximation algorithms for constructing some required structures in digraphs
Keywords: غیر قابل تصور بودن; Combinatorial optimization; Digraph; Structure construction; Inapproximability; (Asymptotic) approximation algorithms
The complexity of computation and approximation of the t-ratio over one-dimensional interval data
Keywords: غیر قابل تصور بودن; Interval data; t-ratio; Computational complexity; NP-hardness; Inapproximability; Pseudopolynomial algorithms;
Optimal approximability of bookmark assignments
Keywords: غیر قابل تصور بودن; Bookmark assignment; Approximation algorithm; Inapproximability
Completely inapproximable monotone and antimonotone parameterized problems
Keywords: غیر قابل تصور بودن; Inapproximability; Fixed-parameter tractability; Circuits; Circuit satisfiability
On the approximability and exact algorithms for vector domination and related problems in graphs
Keywords: غیر قابل تصور بودن; Vector domination; Total vector domination; αα-domination; kk-domination; Multiple domination; Inapproximability; Approximation algorithm; Polynomial time algorithm; Trees; Threshold graphs; P4P4-free graphs
On the inapproximability of maximum intersection problems
Keywords: غیر قابل تصور بودن; Approximation algorithm; Theory of computation; Inapproximability; Maximum intersection; Disclosure control
Minimum latency data aggregation in the physical interference model
Keywords: غیر قابل تصور بودن; Data aggregation; Inapproximability; NP-hardness; Signal-to-interference-noise-ratio; Approximation algorithm
Hardness of discrepancy computation and ε-net verification in high dimension
Keywords: غیر قابل تصور بودن; Discrepancy; Epsilon-nets; Geometric dimension; Parameterized complexity; Inapproximability;
Intractability of approximate multi-dimensional nonlinear optimization on independence systems
Keywords: غیر قابل تصور بودن; Nonlinear discrete optimization; Inapproximability; Erdős–Ko–Rado
Approximation schemes for parallel machine scheduling with availability constraints
Keywords: غیر قابل تصور بودن; PTAS; Inapproximability; Parallel machine; Total weighted completion time
On the complexity of computing treelength
Keywords: غیر قابل تصور بودن; Graph treelength; NP-complete; Approximation; Inapproximability; Exact exponential algorithm; Chordal sandwich problem
The minimum reload ss–tt path, trail and walk problems
Keywords: غیر قابل تصور بودن; Edge-colored graphs; NP-hardness; Reload optimization; Paths, trails and walks; TSP; Inapproximability
Reoptimization of the metric deadline TSP
Keywords: غیر قابل تصور بودن; Reoptimization; Deadline TSP; Metric graphs; Approximation algorithms; Inapproximability
Minimum-weight cycle covers and their approximability
Keywords: غیر قابل تصور بودن; Approximation algorithms; Cycle covers; Inapproximability; Non-constructive algorithms
The complexity of maximum matroid–greedoid intersection and weighted greedoid maximization
Keywords: غیر قابل تصور بودن; Combinatorial optimization; NP-hardness; Inapproximability; Fixed-parameter intractability
On the complexity of finding emerging patterns
Keywords: غیر قابل تصور بودن; Emerging pattern; Inapproximability;
On approximating minimum vertex cover for graphs with perfect matching
Keywords: غیر قابل تصور بودن; Vertex cover; Graph matching; Approximation algorithm; Inapproximability;
The intractability of computing the Hamming distance
Keywords: غیر قابل تصور بودن; Hamming distance; Edit distance; Computational complexity; Parameterized complexity; Inapproximability;