The following pages link to Teofilo F. Gonzalez (Q293372):
Displayed 48 items.
- (Q203383) (redirect page) (← links)
- Improved approximation algorithms for embedding hyperedges in a cycle (Q293373) (← links)
- Multicasting in the hypercube, chord and binomial graphs (Q407543) (← links)
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- (Q799104) (redirect page) (← links)
- On the computational complexity of path cover problems (Q799105) (← links)
- Pairwise edge disjoint shortest paths in the \(n\)-cube (Q861284) (← links)
- Complexity of the minimum-length corridor problem (Q876503) (← links)
- Clustering to minimize the maximum intercluster distance (Q1059958) (← links)
- Improved bounds for rectangular and guillotine partitions (Q1123613) (← links)
- On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927) (← links)
- Sorting numbers in linear expected time and optimal extra space (Q1167543) (← links)
- Covering a set of points in multidimensional space (Q1183467) (← links)
- Approximation algorithms for partitioning a rectangle with interior points (Q1263970) (← links)
- Complexity and approximations for multimessage multicasting (Q1286820) (← links)
- On optimal guillotine partitions approximating optimal \(d\)-box partitions (Q1327171) (← links)
- Simple algorithms for the on-line multidimensional dictionary and related problems (Q1580965) (← links)
- A computationally intractable problem on simplicial complexes (Q1917045) (← links)
- Approximating corridors and tours via restriction and relaxation techniques (Q2930339) (← links)
- Minimizing total completion time on uniform machines with deadline constraints (Q2944508) (← links)
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
- Algorithms for Single Link Failure Recovery and Related Problems (Q3378498) (← links)
- Routing Multiterminal Nets Around a Rectangle (Q3757840) (← links)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets (Q3801063) (← links)
- A linear time algorithm for optimal routing around a rectangle (Q3816979) (← links)
- A Note on Open Shop Preemptive Schedules (Q3856092) (← links)
- A New Algorithm for Preemptive Scheduling of Trees (Q3891759) (← links)
- (Q3944005) (← links)
- Evaluation of Arithmetic Expressions with Algebraic Identities (Q3959418) (← links)
- Unit Execution Time Shop Problems (Q3965898) (← links)
- Grid stretching algorithms for routing multiterminal nets through a rectangle (Q4015538) (← links)
- Optimal Preemptive Scheduling of Two Unrelated Processors (Q4025916) (← links)
- Open Shop Scheduling to Minimize Finish Time (Q4111095) (← links)
- Bounds for LPT Schedules on Uniform Processors (Q4117391) (← links)
- P-Complete Approximation Problems (Q4119042) (← links)
- Preemptive Scheduling of Uniform Processor Systems (Q4139680) (← links)
- Flowshop and Jobshop Schedules: Complexity and Approximation (Q4147825) (← links)
- An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests (Q4170052) (← links)
- An efficient approximate algorithm for the Kolmogorov—Smirnov and Lilliefors tests<sup>†</sup> (Q4172766) (← links)
- (Q4206398) (← links)
- (Q4223773) (← links)
- AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES (Q4289635) (← links)
- Single phase three-layer channel routing algorithms (Q4325355) (← links)
- (Q4643851) (← links)
- (Q4763423) (← links)
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS (Q5249291) (← links)
- Simple algorithms for multimessage multicasting with forwarding (Q5943661) (← links)