Author image not provided
 Venkatesh Natarajan

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.00
Citation Count2
Publication count2
Publication years2007-2009
Available for download2
Average downloads per article362.00
Downloads (cumulative)724
Downloads (12 Months)21
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
July 2009 ACM Transactions on Algorithms (TALG): Volume 5 Issue 3, July 2009
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 29,   Downloads (Overall): 453

Full text available: PDFPDF
For a graph ( V , E ), existing compact linear formulations for the minimum cut problem require Θ(| V || E |) variables and constraints and can be interpreted as a composition of | V | − 1 polyhedra for minimum s - t cuts in much the same ...
Keywords: Linear programming formulation complexity, minimum cut problem

2
January 2007 SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 1,   Downloads (Overall): 250

Full text available: PDFPDF
For a graph ( V, E ), existing compact linear formulations for the minimum cut problem require Θ(| V || E |) variables and constraints and can be interpreted as a composition of | V |--1 polyhedra for minimum s-t cuts in much the same way as early approaches to ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us