The following pages link to (Q3002852):
Displayed 50 items.
- Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- A class of node based bottleneck improvement problems (Q2503225) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- On some optimization problems in molecular biology (Q2643356) (← links)
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
- Complexity of constrained sensor placement problems for optimal observability (Q2665404) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- (Q2741527) (← links)
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine (Q2817891) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS (Q3065615) (← links)
- Design and performance evaluation of communication algorithms in multihop wireless networks with multiple channels (Q3072373) (← links)
- Line planning, path constrained network flow and inapproximability (Q3076020) (← links)
- In a World of P=BPP (Q3088186) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Randomness and Computation (Q3088199) (← links)
- Contemplations on Testing Graph Properties (Q3088201) (← links)
- Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- ON RECTANGULAR COVERING PROBLEMS (Q3401889) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- Mixing of the Glauber dynamics for the ferromagnetic Potts model (Q3467578) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
- Optimal shape of a blob (Q3529827) (← links)
- Object Caching for Queries and Updates (Q3605515) (← links)
- Clustering Using Objective Functions and Stochastic Search (Q3631447) (← links)
- AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM (Q3636563) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
- Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← links)
- Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items (Q4596164) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover (Q4639895) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)