The following pages link to (Q3002852):
Displaying 50 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Fast machine reassignment (Q338866) (← links)
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Voronoi game on graphs (Q476871) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Stochastic enumeration method for counting trees (Q518856) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Irreversible Monte Carlo algorithms for efficient sampling (Q629029) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- 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)
