The following pages link to (Q3002852):
Displayed 50 items.
- Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543) (← links)
- A mean field approach for optimization in discrete time (Q633816) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Station assignment with reallocation (Q666668) (← links)
- The checkpoint problem (Q714790) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- On the maximum size of a minimal \(k\)-edge connected augmentation (Q765200) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Classification using proximity catch digraphs (Q782440) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Complexity of core allocation for the bin packing game (Q833586) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On the multi-radius cover problem (Q845720) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- Maximizing data locality in distributed systems (Q856409) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- On a posterior evaluation of a simple greedy method for set packing (Q941055) (← links)
- Large gaps in one-dimensional cutting stock problems (Q944749) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)