Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [3]	Hilfe

Suche: Series=LNCS AND YEAR=2014

• Approximate counting of matchings in (3,3)-hypergraphs
  Andrzej Dudek, Marek Karpinski, Andrzej Ruciński, Edyta Szymańska
  Lecture Notes in Computer Science 8503, 2014, pp. 380-391
• The cycling property for the clutter of odd st-walks
  Ahmad Abdi, Bertrand Guenin
  Lecture Notes in Computer Science 8494, 2014, pp. 1-12
• On simplex pivoting rules and complexity theory
  Ilan Adler, Christos Papadimitriou, Aviad Rubinstein
  Lecture Notes in Computer Science 8494, 2014, pp. 13-24
• A strongly polynomial time algorithm for multicriteria global minimum cuts
  Hassene Aissi, A. Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
  Lecture Notes in Computer Science 8494, 2014, pp. 25-36
• Integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf's theorem
  Iskander Aliev, Jesús A. De Loera, Quentin Louveaux
  Lecture Notes in Computer Science 8494, 2014, pp. 37-51
• Centrality of trees for capacitated k-center
  Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
  Lecture Notes in Computer Science 8494, 2014, pp. 52-63
• Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints
  Alejandro Angulo, Daniel Espinoza, Rodrigo Palma
  Lecture Notes in Computer Science 8494, 2014, pp. 64-75
• On the unique-lifting property
  Gennadiy Averkov, Amitabh Basu
  Lecture Notes in Computer Science 8494, 2014, pp. 76-87
• Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
  Mourad Baïou, Francisco Barahona
  Lecture Notes in Computer Science 8494, 2014, pp. 88-101
• n-step cycle inequalities: Facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem
  Manish Bansal, Kiavash Kianfar
  Lecture Notes in Computer Science 8494, 2014, pp. 102-113
• On the adaptivity gap of stochastic orienteering
  Nikhil Bansal, Viswanath Nagarajan
  Lecture Notes in Computer Science 8494, 2014, pp. 114-125
• A utility equivalence theorem for concave functions
  Anand Bhalgat, Sanjeev Khanna
  Lecture Notes in Computer Science 8494, 2014, pp. 126-137
• Network improvement for equilibrium routing
  Umang Bhaskar, Katrina Ligett, Leonard J. Schulman
  Lecture Notes in Computer Science 8494, 2014, pp. 138-149
• Finding small stabilizers for unstable graphs
  Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
  Lecture Notes in Computer Science 8494, 2014, pp. 150-161
• The triangle splitting method for biobjective mixed integer programming
  Natashia Boland, Hadi Charkhgard, Martin Savelsbergh
  Lecture Notes in Computer Science 8494, 2014, pp. 162-173
• Cut generation through binarization
  Pierre Bonami, François Margot
  Lecture Notes in Computer Science 8494, 2014, pp. 174-185
• A \frac{5}{4}-approximation for subcubic 2EC using circulations
  Sylvia Boyd, Yao Fu, Yu Sun
  Lecture Notes in Computer Science 8494, 2014, pp. 186-197
• Box-constrained mixed-integer polynomial optimization using separable underestimators
  Christoph Buchheim, Claudia D'Ambrosio
  Lecture Notes in Computer Science 8494, 2014, pp. 198-209
• Submodular maximization meets streaming: Matchings, matroids, and more
  Amit Chakrabarti, Sagar Kale
  Lecture Notes in Computer Science 8494, 2014, pp. 210-221
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs
  Chandra Chekuri, Alina Ene
  Lecture Notes in Computer Science 8494, 2014, pp. 222-233
• Reverse split rank
  Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
  Lecture Notes in Computer Science 8494, 2014, pp. 234-248
• Strong LP formulations for scheduling splittable jobs on unrelated machines
  José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae
  Lecture Notes in Computer Science 8494, 2014, pp. 249-260
• How good are sparse cutting-planes?
  Santanu S. Dey, Marco Molinaro, Qianyi Wang
  Lecture Notes in Computer Science 8494, 2014, pp. 261-272
• Short tours through large linear forests
  Uriel Feige, R. Ravi, Mohit Singh
  Lecture Notes in Computer Science 8494, 2014, pp. 273-284
• Linear programming hierarchies suffice for directed Steiner tree
  Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani
  Lecture Notes in Computer Science 8494, 2014, pp. 285-296