Keywords: الگوریتم تقریبی; Facility location; Approximation algorithms; Fault-tolerance;
مقالات ISI الگوریتم تقریبی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: الگوریتم تقریبی; Spread of influence; Non-progressive; MinPTS problem; NP-hardness; Approximation algorithms
Keywords: الگوریتم تقریبی; Packing; Approximation algorithms; Variable quality-of-service
Keywords: الگوریتم تقریبی; Traveling salesman problem; Bottleneck problems; Experimental analysis; Heuristics; Complexity; Approximation algorithms
Keywords: الگوریتم تقریبی; Graph algorithms; Approximation algorithms; Tree spanner problem; Collective tree spanners; Spanners of bounded tree-width; Robertson-Seymour's tree-decomposition; Balanced separators;
Keywords: الگوریتم تقریبی; Approximation algorithms; Combinatorial optimization; Linear programming; Graph algorithms
Keywords: الگوریتم تقریبی; Approximation algorithms; Fuel consumption; Cumulative vehicle routing problem;
Keywords: الگوریتم تقریبی; Assignment problems; Combinatorial optimization; Approximation algorithms; Computational complexity;
Keywords: الگوریتم تقریبی; Network design; Degree-constraints; Approximation algorithms;
Keywords: الگوریتم تقریبی; Strip Packing; GRASP; Approximation algorithms;
Keywords: الگوریتم تقریبی; Approximation algorithms; Bounded-degree spanning trees; Connected graph factors; Network design;
Keywords: الگوریتم تقریبی; Randomized algorithms; Approximation algorithms; Analysis of algorithms; Boolean functions; Isomorphism problem
Keywords: الگوریتم تقریبی; Approximation algorithms; Minimum 2-edge connected spanning subgraphs; {3,4}{3,4}-covering 2-factors
Keywords: الگوریتم تقریبی; Farthest Point Sampling; Approximate geodesics; Shortest paths; Planar graphs; Approximation algorithms
Keywords: الگوریتم تقریبی; Strip packing; Approximation algorithms; Harmonic algorithms
Keywords: الگوریتم تقریبی; Kinetic clustering; Line trajectory; Approximation algorithms; Computational geometry
Keywords: الگوریتم تقریبی; Approximation algorithms; Traveling salesman problem; Barnette’s conjecture; Combinatorial optimization
An FPTAS for the knapsack problem with parametric weights
Keywords: الگوریتم تقریبی; Knapsack problems; Parametric optimization; Approximation algorithms;
A QPTAS for the base of the number of crossing-free structures on a planar point set
Keywords: الگوریتم تقریبی; Computational geometry; Approximation algorithms; Counting triangulations; Counting spanning trees; Quasi-polynomial-time approximation scheme;
1.5-approximation algorithm for the 2-Convex Recoloring problem
Keywords: الگوریتم تقریبی; Approximation algorithms; Convex recoloring; Greedy;
Universal approximate simplification under the discrete Fréchet distance
Keywords: الگوریتم تقریبی; Polygonal curves; Curve simplification; Discrete Fréchet distance; Approximation algorithms;
Approximating Steiner trees and forests with minimum number of Steiner points
Keywords: الگوریتم تقریبی; Wireless networks; Unit-disc graph; Steiner tree; Steiner forest; 2-connectivity; Approximation algorithms;
Towards a characterization of constant-factor approximable finite-valued CSPs
Keywords: الگوریتم تقریبی; Constraint satisfaction problem; Approximation algorithms; Universal algebra;
A DSS based on optimizer tools and MTS meta-heuristic for the Warehousing Problem with Conflicts
Keywords: الگوریتم تقریبی; Warehousing problem; Bin packing problem; Bin packing problem with conflict; Tabu-search algorithm; Approximation algorithms;
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs
Keywords: الگوریتم تقریبی; Approximation algorithms; Combinatorial algorithms; Non linear program; Graph algorithms; Maximum coverage;
Throughput optimization for admitting NFV-enabled requests in cloud networks
Keywords: الگوریتم تقریبی; Throughput maximization; Cost minimization; Approximation algorithms; Online algorithms; Network function virtualization; Algorithm analysis;
APX-hardness of maximizing Nash social welfare with indivisible items
Keywords: الگوریتم تقریبی; Approximation algorithms; Nash social welfare; Hardness of approximation; APX-hardness;
Tight approximation bounds for dominating set on graphs of bounded arboricity
Keywords: الگوریتم تقریبی; Dominating set; Bounded arboricity; Approximation algorithms;
PTAS for minimum k-path vertex cover in ball graph
Keywords: الگوریتم تقریبی; Approximation algorithms; k-path vertex cover; Ball graph; PTAS;
A 3-approximation algorithm for the maximum leaf k-forest problem
Keywords: الگوریتم تقریبی; approximation algorithms; maximum leaf spanning tree; k-forest;
An Approximation Algorithm for the p-Hub Median Problem
Keywords: الگوریتم تقریبی; approximation algorithms; linear programming; hub location problems; p-hub median problem;
An FPTAS for the parametric knapsack problem
Keywords: الگوریتم تقریبی; Knapsack problems; Parametric optimization; Approximation algorithms;
Dynamic data structures for approximate Hausdorff distance in the word RAM
Keywords: الگوریتم تقریبی; Dynamic data structures; Hausdorff distance; Approximation algorithms;
On approximability of optimization problems related to Red/Blue-split graphs
Keywords: الگوریتم تقریبی; Parametrized complexity; Approximation algorithms; König-Egerváry graphs; Red/Blue-split graphs;
Approximation algorithms for the unit disk cover problem in 2D and 3D
Keywords: الگوریتم تقریبی; Unit disk covering; Unit ball covering; Approximation algorithms;
FPT approximation schemes for maximizing submodular functions
Keywords: الگوریتم تقریبی; Parameterized complexity; Fixed parameter tractability; Approximation algorithms; Computational social choice; Matching;
Minmax Circular Sector Arc for External Plagiarism's Heuristic Retrieval stage
Keywords: الگوریتم تقریبی; External Plagiarism; Heuristic Retrieval; Locality-sensitive hashing; High-dimensional spaces; Pattern clustering; Approximate nearest neighbor search; Hashing method; Hashing time reduction; Min-max hash method; Pairwise Jaccard similarity estimation;
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
Keywords: الگوریتم تقریبی; TSP; Relaxed triangle inequality; Approximation algorithms;
Computing Roman domatic number of graphs
Keywords: الگوریتم تقریبی; Roman domatic number; Graph; Computational complexity; Approximation algorithms
Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint
Keywords: الگوریتم تقریبی; Approximation algorithms; Submodular function; b-Matching
Clustering on k-edge-colored graphs
Keywords: الگوریتم تقریبی; Clustering; Approximation algorithms; Coloring;
Approximation and hardness results for the maximum edge q-coloring problem
Keywords: الگوریتم تقریبی; Hardness of approximation; Approximation algorithms; Graph coloring;
On computing the 2-vertex-connected components of directed graphs
Keywords: الگوریتم تقریبی; Graph algorithms; 2-vertex-connected components; Strong articulation points; Approximation algorithms;
Approximating the k-splittable capacitated network design problem
Keywords: الگوریتم تقریبی; Approximation algorithms; Graph algorithms; Routing problems; Network optimization;
Using the WOWA operator in robust discrete optimization problems
Keywords: الگوریتم تقریبی; Robust optimization; Weighted OWA; Computational complexity; Approximation algorithms
Optimal cost almost-sure reachability in POMDPs
Keywords: الگوریتم تقریبی; POMDPs; Reachability objectives; Total cost; Approximation algorithms;
A practical approximation algorithm for the LTS estimator
Keywords: الگوریتم تقریبی; Robust estimation; Linear estimation; Least trimmed squares; Approximation algorithms; Computational geometry;
An LP-rounding 22-approximation for restricted maximum acyclic subgraph
Keywords: الگوریتم تقریبی; Approximation algorithms; Directed graphs; Vertex pricing; Linear programming; Derandomization;
Approximation algorithms for clique transversals on some graph classes
Keywords: الگوریتم تقریبی; Approximation algorithms; Clique transversal; Graph classes; NP-hard
A note on the traveling salesman reoptimization problem under vertex insertion
Keywords: الگوریتم تقریبی; Approximation algorithms; Reoptimization under vertex insertion; TSP