Pages that link to "Item:Q5897767"
From MaRDI portal
The following pages link to FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897767):
Displayed 10 items.
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Approximation algorithms for the minimum rainbow subgraph problem (Q709311) (← links)
- Rounding to an integral program (Q943791) (← links)
- The minimum substring cover problem (Q958306) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs (Q5130515) (← links)
- The Minimum Substring Cover Problem (Q5443381) (← links)