Pages that link to "Item:Q1600093"
From MaRDI portal
The following pages link to A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093):
Displayed 24 items.
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- On the complexity of compressing two dimensional routing tables with order (Q1702127) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- On an ordering problem in weighted hypergraphs (Q2115861) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Minimum-weight combinatorial structures under random cost-constraints (Q2223474) (← links)
- Efficient reassembling of graphs. I: The linear case (Q2359807) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (Q5041192) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- (Q5743409) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)