The following pages link to Barna Saha (Q269999):
Displaying 30 items.
- New approximation results for resource replication problems (Q270001) (← links)
- Min-max correlation clustering via multicut (Q2293081) (← links)
- Set Cover Revisited: Hypergraph Cover with Hard Capacities (Q2843299) (← links)
- (Q2963933) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- AdCell: Ad Allocation in Cellular Networks (Q3092239) (← links)
- New Approximation Results for Resource Replication Problems (Q3167398) (← links)
- On Finding Dense Subgraphs (Q3638066) (← links)
- A new approximation technique for resource‐allocation problems (Q4584915) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i> -Median (Q4962613) (← links)
- (Q5075830) (← links)
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (Q5111349) (← links)
- Does preprocessing help in fast sequence comparisons? (Q5144952) (← links)
- Dynamic set cover: improved algorithms and lower bounds (Q5212753) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- (Q5365103) (← links)
- A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i>-Median (Q5383960) (← links)
- New Constructive Aspects of the Lovász Local Lemma (Q5395672) (← links)
- (Q5417714) (← links)
- On Estimating Path Aggregates over Streaming Graphs (Q5459112) (← links)
- (Q5875512) (← links)
- (Q6168412) (← links)
- Improved approximation algorithms for Dyck edit distance and RNA folding (Q6560838) (← links)
- The complexity of average-case dynamic subgraph counting (Q6575095) (← links)
- An upper bound and linear-space queries on the LZ-End parsing (Q6575186) (← links)
- How compression and approximation affect efficiency in string distance measures (Q6575187) (← links)
- Approximating LCS and alignment distance over multiple sequences (Q6591910) (← links)
- An algorithmic bridge between Hamming and Levenshtein distances (Q6610324) (← links)
- Faster approximate all pairs shortest paths (Q6645541) (← links)
