The following pages link to (Q4258215):
Displaying 50 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Sensor placement for fault location identification in water networks: a minimum test cover approach (Q311945) (← links)
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- ``Grouping strategies and thresholding for high dimensional linear models'': discussion (Q394554) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Measuring the impact of MVC attack in large complex networks (Q506775) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Set multi-covering via inclusion-exclusion (Q837180) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- A new asymptotic notation: Weak Theta (Q1666904) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
- Approximation of the quadratic knapsack problem (Q1694783) (← links)
- \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements (Q1751413) (← links)
- On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- Quantifying spatial misallocation in centrally provided public goods (Q1934690) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- Regret-minimizing Bayesian persuasion (Q2100634) (← links)
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem (Q2132409) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem (Q2182716) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
- Optimal facility location problem on polyhedral terrains using descending paths (Q2210515) (← links)
- Optimal wireless charger placement with individual energy requirement (Q2220775) (← links)
- Matching influence maximization in social networks (Q2220781) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- Sampling \(k\)-partite graphs with a given degree sequence (Q2326166) (← links)
