The following pages link to Roberto Solis-Oba (Q203725):
Displaying 50 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← links)
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Network design via iterative rounding of setpair relaxations (Q858116) (← links)
- Cellular genetic algorithms (Q935698) (← links)
- \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)
- Algorithms for measuring perturbality in matroid optimization (Q1297736) (← links)
- An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- More on change-making and related problems (Q2051861) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- Foundations of multidimensional and metric data structures. (Q2488572) (← links)
- (Q2753955) (← links)
- How helpers hasten \(h\)-relations (Q2765958) (← links)
- Makespan minimization in job shops: a polynomial time approximation scheme (Q2819572) (← links)
- On some results for the \(L(2,1)\)-labeling on Cartesian sum graphs. (Q2828921) (← links)
- A new characterization of disk graphs and its application. (Q2829061) (← links)
- On packing rectangles with resource augmentation: maximizing the profit (Q2867317) (← links)
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths (Q2884299) (← links)
- Packing squares with profits (Q2902901) (← links)
- Job shop scheduling with unit length tasks (Q2905324) (← links)
- Approximate nearest neighbor: towards removing the curse of dimensionality (Q2913814) (← links)
- Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
- A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847) (← links)
- New Approximability Results for 2-Dimensional Packing Problems (Q3525560) (← links)
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths (Q3569837) (← links)
- An asymptotic approximation algorithm for 3D-strip packing (Q3581487) (← links)
- (Q4252040) (← links)
- (Q4425952) (← links)
- (Q4426361) (← links)
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme (Q4443085) (← links)
- (Q4448360) (← links)
- (Q4508364) (← links)
- (Q4527196) (← links)
- (Q4683282) (← links)
- (Q4683303) (← links)
- (Q4875228) (← links)
- Increasing the Weight of Minimum Spanning Trees (Q4935308) (← links)
- (Q4941835) (← links)
