The following pages link to Least and most colored bases (Q2381817):
Displaying 4 items.
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)