No photo of Chandra Sekhar Chekuri

View Scopus Profile

Chandra Sekhar Chekuri

Filter
Conference contribution

Search results

  • 2011

    Approximability of capacitated network design

    Chakrabarty, D., Chekuri, C., Khanna, S. & Korula, N., 2011, Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, Proceedings. p. 78-91 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6655 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Approximation algorithms for submodular multiway partition

    Chekuri, C. & Ene, A., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 807-816 10 p. 6108251. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Multi-budgeted matchings and matroid intersection via dependent rounding

    Chekuri, C., Vondrák, J. & Zenklusen, R., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 1080-1097 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)

    Chekuri, C., Gal, A., Im, S., Khuller, S., Li, J., McCutchen, R., Moseley, B. & Raschid, L., 2011, Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Revised Papers. p. 71-82 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6534 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Prize-collecting Steiner problems on planar graphs

    Bateni, M., Chekuri, C., Ene, A., Hajiaghayi, M. T., Korula, N. & Marx, D., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 1028-1049 22 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Submodular cost allocation problem and applications

    Chekuri, C. & Ene, A., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 354-366 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6755 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Submodular function maximization via the multilinear relaxation and contention resolution schemes

    Chekuri, C., Vondrák, J. & Zenklusen, R., 2011, STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 783-792 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
  • 2010

    Dependent randomized rounding via exchange properties of combinatorial structures

    Chekuri, C., Vondrák, J. & Zenklusen, R., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 575-584 10 p. 5671314. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Flow-cut gaps for integer and fractional multiflows

    Chekuri, C., Shepherd, F. B. & Weibel, C., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, p. 1198-1208 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
  • 2009

    A graph reduction step preserving element-connectivity and applications

    Chekuri, C. & Korula, N., 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 254-265 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Longest wait first for broadcast scheduling

    Chekuri, C., Im, S. & Moseley, B., 2009, Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers. p. 62-74 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5893 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Minimizing maximum response time and delay factor in broadcast scheduling

    Chekuri, C., Im, S. & Moseley, B., 2009, Algorithms - ESA 2009 - 17th Annual European Symposium, Proceedings. p. 444-455 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5757 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Online scheduling to minimize the maximum delay factor

    Chekuri, C. & Moseley, B., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, p. 1116-1125 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • On the set multi-cover problem in geometric settings

    Chekuri, C., Clarkson, K. L. & Sariel, H. P., 2009, Proceedings of the 25th Annual Symposium on Computational Geometry, SCG'09. p. 341-350 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Topology formation for wireless mesh network planning

    Chen, C. C., Chekuri, C. & Klabjan, D., 2009, IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. p. 2671-2675 5 p. 5062209. (Proceedings - IEEE INFOCOM).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Truthful mechanisms via greedy iterative packing

    Chekuri, C. & Gamzu, I., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 56-69 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Unsplittable flow in paths and trees and column-restricted packing integer programs

    Chekuri, C., Ene, A. & Korula, N., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 42-55 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2008

    Algorithms for 2-route cut problems

    Chekuri, C. & Khanna, S., 2008, Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1 ed. p. 472-484 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5125 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Improved algorithms for orienteering and related problems

    Chekuri, C., Korula, N. & Pal, M., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 661-670 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Pruning 2-connected graphs

    Chekuri, C. & Korula, N., 2008, FSTTCS 2008 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. p. 119-130 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 2).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Routing bandwidth guaranteed paths with local restoration in label switched networks

    Li, L., Buddhikot, M. M., Chekuri, C. & Guo, K., 2008, Proceedings - 10th IEEE International Conference on Network Protocols, ICNP 2002. IEEE Computer Society, p. 110-120 11 p. 1181392. (Proceedings - International Conference on Network Protocols, ICNP).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Set connectivity problems in undirected graphs and the directed Steiner network problem

    Chekuri, C., Even, G., Gupta, A. & Segev, D., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 532-541 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Single-sink network design with vertex connectivity requirements

    Chekuri, C. & Korula, N., 2008, FSTTCS 2008 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. p. 131-142 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 2).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2007

    Approximation algorithms for node-weighted buy-at-bulk network design

    Chekuri, C., Hajiaghayi, M. T., Kortsarz, G. & Salavatipour, M. R., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 1265-1274 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Buy-at-bulk network design with protection

    Antonakopoulos, S., Chekuri, C., Shepherd, B. & Zhang, L., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 634-644 11 p. 4389532. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Maximizing a submodular set function subject to a matroid constraint

    Calinescu, G., Chekuri, C., Pál, M. & Vondrák, J., 2007, Integer Programming and Combinatorial Optimization - 12th International IPCO Conference, Proceedings. p. 182-196 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4513 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2006

    An O(log n) approximation ratio for the asymmetric traveling salesman path problem

    Chekuri, C. & Pál, M., 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. Springer, p. 95-103 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Approximation algorithms for non-uniform buy-at-bulk network design

    Chekuri, C., Hajiaghayi, M. T., Kortsarz, G. & Salavatipour, M. R., 2006, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. p. 677-686 10 p. 4031402. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Edge-disjoint paths in planar graphs with constant congestion

    Chekuri, C., Khanna, S. & Shepherd, F. B., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 757-766 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access

  • Non-cooperative multicast and facility location games

    Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J. & Orda, A., 2006, Proceedings of the 7th ACM Conference on Electronic Commerce 2006. Association for Computing Machinery, p. 72-81 10 p. (Proceedings of the ACM Conference on Electronic Commerce; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • On achievable information rates in single-source non-uniform demand networks

    Chekuri, C., Fragouli, C. & Soljanin, E., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 773-777 5 p. 4036068. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2005

    A recursive greedy algorithm for walks in directed graphs

    Chekuri, C. & Pál, M., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 245-253 9 p. 1530718. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • On average throughput and alphabet size in network coding

    Chekuri, C., Fragouli, C. & Soljanin, E., 2005, Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05. p. 1593-1597 5 p. 1523613. (IEEE International Symposium on Information Theory - Proceedings; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
  • 2004

    DCM selection on an optical line system

    Chekuri, C., Lee, W. & Zhang, L., 2004, Networks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium. VDE Verlag GmbH, p. 385-390 6 p. (Networks 2004 - 11th International Telecommunications Network Strategy and Planning Symposium).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2003

    Partially Coherent Rayleigh Noise in Forward Error Corrected Optical Links

    Radic, S., Chandrasekhar, C., Vukovic, N. & Velingker, A., 2003, Optical Fiber Communication Conference, OFC 2003. Optica Publishing Group (formerly OSA), p. 20-21 2 p. ThN4. (Optics InfoBase Conference Papers).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2002

    Approximation algorithms for the unsplittable flow problem

    Chakrabarti, A., Chekuri, C., Gupta, A. & Kumar, A., 2002, Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Proceedings. Jansen, K., Leonardi, S. & Vazirani, V. (eds.). Springer, p. 51-67 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2462).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Building edge-failure resilient networks

    Chekuri, C., Gupta, A., Kumar, A., Naor, J. & Raz, D., 2002, Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Cook, W. J. & Schulz, A. S. (eds.). Springer, p. 439-456 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2337 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
  • 2001

    A deterministic algorithm for the cost-distance problem

    Chekuri, C., Khanna, S. & Naor, J., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 232-233 2 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Approximation algorithms for the metric labeling problem via a new linear programming formulation

    Chekuri, C., Khanna, S., Naor, J. & Zosin, L., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 109-118 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • A PTAS for minimizing weighted completion time on uniformly related machines (extended abstract)

    Chekuri, C. & Khanna, S., 2001, Automata, Languages and Programming - 28th International Colloquium, ICALP 2001, Proceedings. Orejas, F., Spirakis, P. G. & van Leeuwen, J. (eds.). Springer, p. 848-861 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2076 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2000

    Blocking probability estimates in a partitioned sector TDMA system

    Chekuri, C., Ramanan, K., Whiting, P. & Zhang, L., 2000, Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. Association for Computing Machinery, p. 28-34 7 p. (Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1999

    Performance guarantees for the TSP with a parameterized triangle inequality

    Bender, M. A. & Chekuri, C., 1999, Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Dehne, F., Sack, J.-R., Gupta, A. & Tamassia, R. (eds.). Springer, p. 80-85 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1663).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1998

    An efficient approximation algorithm for minimizing makespan on uniformly related machines

    Chekuri, C. & Bender, M., 1998, Integer Programming and Combinatorial Optimization - 6th International IPCO Conference, 1998, Proceedings. Andrew Boyd, E., Bixby, R. E. & Rios-Mercado, R. Z. (eds.). Springer, p. 383-393 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1412).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1997

    Conjunctive query containment revisited: Extended Abstract

    Chekuri, C. & Rajaraman, A., 1997, Database Theory - ICDT 1997 - 6th International Conference, Proceedings. Afrati, F. & Kolaitis, P. (eds.). Springer, p. 56-70 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1186).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 1996

    Fast estimation of diameter and shortest paths (Without matrix multiplication)

    Aingworth, D., Chekuri, C. & Motwani, R., Jan 28 1996, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Association for Computing Machinery, p. 547-553 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129447).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution