Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Chandrasekaran, Karthekeyan
85  Ergebnisse:
Personensuche X
?
1

Min–Max Partitioning of Hypergraphs and Symmetric Submodula..:

Chandrasekaran, Karthekeyan ; Chekuri, Chandra
Combinatorica.  43 (2023)  3 - p. 455-477 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Analyzing Residual Random Greedy for monotone submodular ma..:

Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás.
Information Processing Letters.  180 (2023)  - p. 106340 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Faster Connectivity in Low-Rank Hypergraphs via Expander De..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Mukhopadhyay, Sagnik. - p. 70-83 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Fixed parameter approximation scheme for min-max k-cut:

Chandrasekaran, Karthekeyan ; Wang, Weihang
Mathematical Programming.  197 (2022)  2 - p. 1093-1144 , 2022
Link: https://doi.org/10.1007/..
 
?
5

$$\ell _p$$-Norm Multiway Cut:

Chandrasekaran, Karthekeyan ; Wang, Weihang
Algorithmica.  84 (2022)  9 - p. 2667-2701 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Multicriteria cuts and size-constrained k-cuts in hypergrap..:

Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Xu, Chao
Mathematical Programming.  197 (2021)  1 - p. 27-69 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Fixed Parameter Approximation Scheme for Min-Max k-Cut:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Chandrasekaran, Karthekeyan ; Wang, Weihang - p. 354-367 , 2021
Link: https://doi.org/10.1007/..
 
?
8

The Maximum Binary Tree Problem:

Chandrasekaran, Karthekeyan ; Grigorescu, Elena ; Istrate, Gabriel...
Algorithmica.  83 (2021)  8 - p. 2427-2468 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Min-max partitioning of hypergraphs and symmetric submodula..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Chandrasekaran, Karthekeyan ; Chekuri, Chandra - p. 1026-1038 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Min-max Partitioning of Hypergraphs and Symmetric Submodula..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Chandrasekaran, Karthekeyan ; Chekuri, Chandra - p. 1026-1038 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Improving the Smoothed Complexity of FLIP for Max Cut Probl..:

Bibak, Ali ; Carlson, Charles ; Chandrasekaran, Karthekeyan
ACM Transactions on Algorithms.  17 (2021)  3 - p. 1-38 , 2021
Link: https://doi.org/10.1145/..
 
?
12

Improving the Smoothed Complexity of FLIP for Max Cut Probl..:

Bibak, Ali ; Carlson, Charles ; Chandrasekaran, Karthekeyan
ACM Transactions on Algorithms (TALG).  17 (2021)  3 - p. 1-38 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Hypergraph $k$-cut for fixed $k$ in deterministic polynomia..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Chandrasekaran, Karthekeyan ; Chekuri, Chandra - p. 810-821 , 2020
Link: https://doi.org/10.1109/..
 
?
14

Spectral aspects of symmetric matrix signings:

Carlson, Charles ; Chandrasekaran, Karthekeyan ; Chang, Hsien-Chih..
Discrete Optimization.  37 (2020)  - p. 100582 , 2020
Link: https://doi.org/10.1016/..
 
?
15

Improving the integrality gap for multiway cut:

Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás.
Mathematical Programming.  183 (2020)  1-2 - p. 171-193 , 2020
Link: https://doi.org/10.1007/..
 
1-15