Pages that link to "Item:Q5900783"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5900783):
Displaying 14 items.
- Optimizing budget allocation for center and median points (Q265070) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- On the complexity of computing the temporal hybridization number for two phylogenies (Q1949091) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Using VNS for the optimal synthesis of the communication tree in wireless sensor networks (Q2631223) (← links)
- On the hardness of range assignment problems (Q3548718) (← links)
