The following pages link to (Q4198056):
Displaying 50 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices (Q254898) (← links)
- Speed scaling for maximum lateness (Q255271) (← links)
- A membrane algorithm with quantum-inspired subalgorithms and its application to image processing (Q256448) (← links)
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems (Q256691) (← links)
- Computational complexity in the design of voting rules (Q256771) (← links)
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Maximal and supremal tolerances in multiobjective linear programming (Q257229) (← links)
- Regular independent sets (Q260019) (← links)
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- A hybrid evolutionary approach for set packing problem (Q260677) (← links)
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Optimization in temporal qualitative constraint networks (Q262133) (← links)
- The focus of attention problem (Q262243) (← links)
- Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs (Q263077) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Inter-school bus scheduling under stochastic travel times (Q264322) (← links)
- Flat maximal parallelism in P systems with promoters (Q264535) (← links)
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Extended cuts (Q266025) (← links)
- Improving robustness of next-hop routing (Q266050) (← links)
- Linearizable special cases of the QAP (Q266060) (← links)
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete (Q266272) (← links)
- Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← links)
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Global cycle properties of locally isometric graphs (Q266915) (← links)
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields (Q268465) (← links)
- On the data complexity of consistent query answering (Q269317) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- On computational complexity of graph inference from counting (Q269786) (← links)
- New approximation results for resource replication problems (Q270001) (← links)
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- The statistics of vacuum geometry (Q270797) (← links)
- Scheduling on a single machine under time-of-use electricity tariffs (Q271939) (← links)
