The following pages link to Sounaka Mishra (Q346241):
Displaying 5 items.
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
