A polyhedral study of the maximum edge subgraph problem

Electronic Notes in Discrete Mathematics

Volumn 35, Issue C, 2009, Pages 197-202

  Bonomo, Flavia ^a   Marenco, Javier ^b   Sabán, Daniela ^b   Stier Moses, Nicolás ^c  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b INSTITUTO DE CIENCIAS   (Argentina)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Maximum edge subgraph problem; Polyhedral combinatorics

Indexed keywords

EID: 70949097000     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2009.11.033     Document Type: Article

References (8)

1. Asahiro Y., Iwama K., Tamaki H., and Tokuyama T. Greedily Finding Dense Subgraphs. Journal of Algorithms 34 (2000) 203-221
2. Asahiro Y., Hassin R., and Iwama K. Complexity of finding dense subgraphs. Discrete Applied Mathematics 121 (2002) 15-26
3. Billionnet A. Different formulations for solving the heaviest k-subgraph problem. Information Systems and Operational Research 43 3 (2005) 171-186
4. Feige U., Kortsarz G., and Peleg D. The Dense k-Subgraph Problem. Algorithmica 29 (2001) 410-421
5. Han, Q. Ye, Y. and Zhang, J. 2000, Approximation of Dense-k-Subgraph, Working Paper, Department of Management Sciences, Henry B. Tippie College of Business, The University of Iowa
6. Roupin F., and Billionnet A. A deterministic approximation algorithm for the Densest k-Subgraph Problem. International Journal of Operational Research 3-3 (2008) 301-314
7. D. Saban, Analysis and Models of Bilateral Investment Treaties using a Social Networks Approach, MSc. Thesis (2009), Computer Science Dept., University of Buenos Aires, Buenos Aires, Argentina
8. Wasserman S., and Faust K. Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences) (1994), University Press, Cambridge