Pages that link to "Item:Q1854428"
From MaRDI portal
The following pages link to On weighted vs unweighted versions of combinatorial optimization problems (Q1854428):
Displaying 12 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- Quell (Q500997) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)
- Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)
