337 results on '"APPROXIMATION algorithms"'
Search Results
2. Approximation algorithms for node and element connectivity augmentation problems
3. Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
4. Near-Optimal Auctions on Independence Systems
5. Approximating Long Cycle Above Dirac’s Guarantee
6. New Algorithms for Steiner Tree Reoptimization
7. Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
8. Approximating weighted completion time via stronger negative correlation
9. Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs
10. Connected k-Center and k-Diameter Clustering
11. Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
12. αi-Metric Graphs: Radius, Diameter and all Eccentricities
13. A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
14. The Near Exact Bin Covering Problem
15. Minimizing the maximum lateness for scheduling with release times and job rejection
16. Algorithmic study on liar’s vertex-edge domination problem
17. Approximation algorithms for solving the trip-constrained vehicle routing cover problems
18. Approximating the probabilistic p-Center problem under pressure
19. The preemptive resource allocation problem
20. Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation
21. Matchings under distance constraints II.
22. Approximating Maximum Integral Multiflows on Bounded Genus Graphs
23. Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics
24. Scheduling on a graph with release times
25. EPTAS for parallel identical machine scheduling with time restrictions
26. A Tight (3/2+ε)-Approximation for Skewed Strip Packing
27. Counting Vertices of Integral Polytopes Defined by Facets
28. Approximation algorithms for coupled task scheduling minimizing the sum of completion times
29. Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
30. Deploying vaccine distribution sites for improved accessibility and equity to support pandemic response
31. Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center
32. Improved Bounds for Metric Capacitated Covering Problems
33. Improving Quantum Computation by Optimized Qubit Routing
34. Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives
35. Few Cuts Meet Many Point Sets
36. Fixed-Parameter Algorithms for Unsplittable Flow Cover
37. Regularized impurity reduction: accurate decision trees with complexity guarantees
38. A local search 4/3-approximation algorithm for the minimum 3-path partition problem
39. Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
40. Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations
41. Shortest path with acceleration constraints: complexity and approximation algorithms
42. Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
43. Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
44. 1-line minimum rectilinear steiner trees and related problems
45. Balanced connected partitions of graphs: approximation, parameterization and lower bounds
46. Electoral manipulation via influence: probabilistic model
47. Beyond submodularity: a unified framework of randomized set selection with group fairness constraints
48. Algorithms for the Unit-Cost Stochastic Score Classification Problem
49. Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
50. Leafy spanning k-forests
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.