The following pages link to Bundit Laekhanukit (Q487014):
Displaying 33 items.
- Routing regardless of network stability (Q487016) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs (Q1941534) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (Q2843285) (← links)
- Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs (Q2870515) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- (Q3549695) (← links)
- Faster Algorithms for Semi-matching Problems (Extended Abstract) (Q3587378) (← links)
- Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds (Q4575771) (← links)
- Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs (Q4575785) (← links)
- Approximating Directed Steiner Problems via Tree Embedding (Q4598214) (← links)
- An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem (Q4907576) (← links)
- Approximating Rooted Steiner Networks (Q4962166) (← links)
- Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree (Q4977990) (← links)
- Approximating Spanners and Directed Steiner Forest (Q4987451) (← links)
- (Q5009500) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- <i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree (Q5212767) (← links)
- On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
- On the parameterized complexity of approximating dominating set (Q5230381) (← links)
- On Survivable Set Connectivity (Q5363080) (← links)
- Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems (Q5384080) (← links)
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (Q5405060) (← links)
- (Q5743494) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
