The following pages link to (Q4258216):
Displaying 50 items.
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments (Q635308) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC (Q645822) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- Dense and sparse graph partition (Q714027) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Looking at the stars (Q820158) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Approximating the minimal sensor selection for supervisory control (Q853685) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks (Q887852) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- The phasing of heterozygous traits: Algorithms and complexity (Q929162) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
