358 results on '"Solis-Oba, Roberto"'
Search Results
2. Algorithms for the thief orienteering problem on directed acyclic graphs
3. New Algorithms for Computing Field of Vision over 2D Grids
4. A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
5. A local search approximation algorithm for the multiway cut problem
6. High Multiplicity Strip Packing with Three Rectangle Types
7. Structural Parameters for Scheduling with Assignment Restrictions
8. Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem
9. Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments
10. Makespan Minimization on Unrelated Parallel Machines with a Few Bags
11. Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem
12. Approximation algorithms for the graph balancing problem with two speeds and two job lengths
13. [formula omitted]-Labeling of Kneser graphs and coloring squares of Kneser graphs
14. Local Search
15. Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments
16. Makespan Minimization on Unrelated Parallel Machines with a Few Bags
17. A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
18. Explainable-AI in Automated Medical Report Generation Using Chest X-ray Images
19. An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
20. A Polynomial Time Approximation Scheme for the Square Packing Problem
21. Guest Editorial: Special Issue on Approximation and Online Algorithms
22. Structural Parameters for Scheduling with Assignment Restrictions
23. New Approximability Results for 2-Dimensional Packing Problems
24. Gene Assembly Algorithms for Ciliates
25. Approximation Algorithms for the k-Median Problem
26. Packing Weighted Rectangles into a Square
27. Reducing the Size of NFAs by Using Equivalences and Preorders
28. High Multiplicity Strip Packing with Three Rectangle Types
29. Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints
30. [formula omitted]-labelings on the modular product of two graphs
31. A Framework for Designing Approximation Algorithms for Scheduling Problems
32. An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
33. Job Shop Scheduling Problems with Controllable Processing Times
34. Linear Time Approximation Schemes for Shop Scheduling Problems
35. Approximation Algorithms for Flexible Job Shop Problems
36. How Helpers Hasten h-Relations
37. Approximation Algorithms for Bounded Facility Location
38. A Linear Time Approximation Scheme for the Job Shop Scheduling Problem
39. A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
40. 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
41. Rectangle packing with one-dimensional resource augmentation
42. Simple and Efficient Algorithm for Drone Path Planning
43. Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251)
44. Efficient Field of Vision Algorithms for Large 2D Grids
45. Approximation schemes for job shop scheduling problems with controllable processing times
46. New Algorithms for Computing Field of Vision over 2D Grids
47. Structural parameters for scheduling with assignment restrictions
48. Approximation Algorithms for Bounded Facility Location Problems
49. An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
50. Efficient algorithms for robustness in resource allocation and scheduling problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.