Keywords: سختی NP; Axis-parallel rectangles; Geometric hitting set; NP-hardness; APX-hardness; Computational geometry;
مقالات ISI سختی NP (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: سختی NP; Gas transport network; Instationary gas flow; Time-dependent flow; Complexity; NP-hardness;
Keywords: سختی NP; Computational geometry; Vertex cover; Geometric graph; NP-hardness; FPT;
Keywords: سختی NP; Cubic graph; Equitable coloring; NP-hardness; Polynomial algorithm; Scheduling; Uniform machine;
Keywords: سختی NP; Art Gallery Problem; 2-Transmitter; k-Transmitter; NP-hardness;
Keywords: سختی NP; Parallel dedicated machines; Conflict graph; Fixed sequences; NP-hardness; Dynamic programming;
Keywords: سختی NP; NP-hardness; Approximation algorithms; Border length minimization;
Keywords: سختی NP; Adjacency dimension; Metric dimension; Local metric dimension; NP-hardness;
Keywords: سختی NP; Course allocation; Prerequisites; Pareto optimality; Sequential mechanism; NP-hardness;
Keywords: سختی NP; Topology optimization; Canonical duality theory; Bi-level knapsack problem; NP-hardness; CDT algorithm;
Keywords: سختی NP; Unrecoverable interruptions; Parallel machines scheduling; NP-hardness; Exact and heuristic algorithms;
Keywords: سختی NP; Complexity; Extensions; Helly property; NP-hardness;
Keywords: سختی NP; Approximation algorithm; Channel routing problem; Crosstalk minimization; Doglegging; High-performance routing; NP-hardness;
Keywords: سختی NP; Networks; Graphs; Rooted directed trees; DAGs; Compression; Shortcutting; Diameter; Feedback dimension; Path covers; Stability number; NP-hardness; W[2]-hardness;
Keywords: سختی NP; Scheduling; Heuristics; Parallel-batching machine; Two-agent scheduling; NP-hardness;
Keywords: سختی NP; Maximum leaf spanning tree; NP-hardness; APX-hardness; Planar graph; Cubic graph
Keywords: سختی NP; Metric dimension; Simultaneous metric dimension; Simultaneous metric generator; NP-hardness; Families of trees; Bounds;
Keywords: سختی NP; NP-hardness; Fixed-parameter tractability; W-hardness; Machine learning; Combinatorial feature selection; Dimension reduction; Minimal reduct problem; Combinatorics of binary matrices; Δ-Systems
Keywords: سختی NP; Graph algorithms; Approximation algorithms; Scheduling; Approximation schemes; NP-hardness
Keywords: سختی NP; NP-hardness; Approximation-hardness; W-hardness; Graph algorithms;
Keywords: سختی NP; Algorithms; Approximation algorithms; Bin packing; NP-hardness;
Keywords: سختی NP; Inverse optimization; Combinatorial problems; Bin-packing problem; NP-hardness; Approximation algorithms;
Keywords: سختی NP; Network interdiction; Minimum weighted dominating set; NP-hardness; Branch-and-cut algorithm; Critical elements detection;
Keywords: سختی NP; Vector connectivity; APX-hardness; NP-hardness; Polynomial-time algorithm; Block graphs
Keywords: سختی NP; Scheduling; Deteriorating jobs; Batch; NP-hardness; FPTAS; Non-approximability
Keywords: سختی NP; Flood-It; Free-Flood-It; Shortest common supersequence; NP-hardness; W[1]-hardness; Fixed-parameter tractability
Keywords: سختی NP; Geometric set cover and maximum coverage; Geometric tours; NP-hardness; APX-hardness
Keywords: سختی NP; Parameterized complexity; Matrix and vector decomposition; Multivariate algorithmics; NP-hardness; Exact algorithms
Keywords: سختی NP; Round weighting problem; Flow coloring; Bipartite graphs; NP-hardness; Inapproximability
Keywords: سختی NP; Graph modification; Degree-constrained editing; NP-hardness; Parameterized complexity; Fixed-parameter tractability; Kernelization
Keywords: سختی NP; Nintendo games; Video games; Computational complexity; NP-hardness; PSPACE-hardness
Keywords: سختی NP; Graph drawing; Clustered planarity; Planar graphs; NP-hardness;
Keywords: سختی NP; Linear system; Polytopic uncertainty; Stability; Stabilizability; Computational complexity; NP-hardness
Keywords: سختی NP; Complexity; NP-completeness; NP-hardness; Domination; Bondage; Total bondage; Reinforcement; Total reinforcement
Keywords: سختی NP; Bottleneck matching; Non-crossing configuration; NP-hardness; Approximation algorithms
Keywords: سختی NP; Vertex cover; Transversal number; Matching; Hypergraphs; Clique covering; NP-hardness
Keywords: سختی NP; Spread of influence; Non-progressive; MinPTS problem; NP-hardness; Approximation algorithms
Keywords: سختی NP; Matchings; Edge coloring; Computational complexity; NP-hardness; Bipartite graphs
Keywords: سختی NP; Scheduling; flowshop; chain-reentrant; no-wait; NP-hardness; genetic algorithms
Keywords: سختی NP; Analysis of algorithms; Flow shop; NP-hardness; Optimization
Keywords: سختی NP; Sum–product ratio; NP-hardness; Fully polynomial-time approximation scheme; Consideration set
Keywords: سختی NP; Scheduling; Transportation; Batching; NP-hardness; Strong NP-hardness
Keywords: سختی NP; Digital forensics; Crime scene investigation; NP-hardness; Mixed integer programming; Heuristic solution; Computational results
Keywords: سختی NP; Competitive diffusion game; Pure-strategy Nash equilibrium; Sub-modular function; NP-hardness; Erdos–Renyi graphs; Social welfare
NP-hardness of geometric set cover and hitting set with rectangles containing a common point
Keywords: سختی NP; Axis-parallel rectangles; Geometric set cover; Geometric hitting set; NP-hardness; Computational geometry;
A simple proof that the (n2â¯ââ¯1)-puzzle is hard
Keywords: سختی NP; (n2â1)-puzzle; Complexity of games; NP-hardness; Rectilinear Steiner tree;
On the NP-hardness of scheduling with time restrictions
Keywords: سختی NP; 90B35; 90C27; Single-processor scheduling; Time restrictions; NP-hardness;
NP-hardness and fixed-parameter tractability of the minimum spanner problem
Keywords: سختی NP; Minimum Spanner Problem; Planar graphs; Degree-bounded graphs; NP-hardness; FPT algorithm;
On RAC drawings of 1-planar graphs
Keywords: سختی NP; 1-Planarity; RAC drawings; NP-hardness;
Minimum bisection is NP-hard on unit disk graphs
Keywords: سختی NP; Minimum bisection problem; Unit disk graphs; Planar graphs; NP-hardness;