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	Hilfe

Suche: Series=LNCS AND Volume=6942

• Polynomial-time approximation schemes for maximizing Gross substitutes utility under budget constraints
  Akiyoshi Shioura
  Lecture Notes in Computer Science 6942, 2011, pp. 1-12
• Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
  Loukas Georgiadis
  Lecture Notes in Computer Science 6942, 2011, pp. 13-24
• Improved approximation algorithms for Bipartite Correlation Clustering
  Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen
  Lecture Notes in Computer Science 6942, 2011, pp. 25-36
• Bounds on greedy algorithms for MAX SAT
  Matthias Poloczek
  Lecture Notes in Computer Science 6942, 2011, pp. 37-48
• Approximating minimum Manhattan networks in higher dimensions
  Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen Kobourov, Joachim Spoerhase, Alexander Wolff
  Lecture Notes in Computer Science 6942, 2011, pp. 49-60
• On isolating points using disks
  Matt Gibson, Gaurav Kanade, Kasturi Varadarajan
  Lecture Notes in Computer Science 6942, 2011, pp. 61-69
• An output-sensitive approach for the L_1/L_{\infty} k-nearest-neighbor Voronoi diagram
  Chih-Hung Liu, Evanthia Papadopoulou, Der Tsai Lee
  Lecture Notes in Computer Science 6942, 2011, pp. 70-81
• Can nearest neighbor searching be simple and always fast?
  Victor Alvarez, David G. Kirkpatrick, Raimund Seidel
  Lecture Notes in Computer Science 6942, 2011, pp. 82-92
• On the approximation performance of Fictitious Play We study the performance of Fictitious Play, when used as a heuristic for finding an approximate Nash equilibrium of a two-player game. We exhibit a class of two-player games having payoffs in the range [0,1] that show that Fictitious Play fails to find a solution having an additive approximation guarantee significantly better than 1/2. Our construction shows that for n\times n games, in the worst case both players may perpetually have mixed strategies whose payoffs fall short of the best response by an additive quantity 1/2-O(1/n ^{1-\delta}) for arbitrarily small \delta. We also show an essentially matching upper bound of 1/2-O(1/n).in finite games
  Paul W. Goldberg, Rahul Savani, Troels Bjerre Srensen, Carmine Ventre
  Lecture Notes in Computer Science 6942, 2011, pp. 93-105
• How profitable are strategic behaviors in a market?
  Ning Chen, Xiaotie Deng, Jie Zhang
  Lecture Notes in Computer Science 6942, 2011, pp. 106-118
• Improving the price of anarchy for Selfish Routing via coordination mechanisms
  George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
  Lecture Notes in Computer Science 6942, 2011, pp. 119-130
• Algorithms for finding a maximum non-k-linked graph
  Yusuke Kobayashi, Yuichi Yoshida
  Lecture Notes in Computer Science 6942, 2011, pp. 131-142
• An \mathcal O(n^4) time algorithm to compute the bisection width of solid grid graphs
  Andreas Emil Feldmann, Peter Widmayer
  Lecture Notes in Computer Science 6942, 2011, pp. 143-154
• Min-cuts and shortest cycles in planar graphs in O(n\log\log n) time
  Jakub Ła̧cki, Piotr Sankowski
  Lecture Notes in Computer Science 6942, 2011, pp. 155-166
• Near-popular matchings in the roommates problem
  Chien-Chung Huang, Telikepalli Kavitha
  Lecture Notes in Computer Science 6942, 2011, pp. 167-179
• The hospitals/residents problem with quota lower bounds
  Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
  Lecture Notes in Computer Science 6942, 2011, pp. 180-191
• Multi-parameter mechanism design under budget and matroid constraints
  Monika Henzinger, Angelina Vidali
  Lecture Notes in Computer Science 6942, 2011, pp. 192-202
• Quantified linear programs: A computational study
  Thorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf
  Lecture Notes in Computer Science 6942, 2011, pp. 203-214
• Recoverable robustness by column generation
  P.C. Bouman, J.M. van den Akker, J.A. Hoogeveen
  Lecture Notes in Computer Science 6942, 2011, pp. 215-226
• Passenger flow-oriented train disposition
  Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee
  Lecture Notes in Computer Science 6942, 2011, pp. 227-238
• One to rule them all: A general randomized algorithm for buffer management with bounded delay
  Łukasz Jeż
  Lecture Notes in Computer Science 6942, 2011, pp. 239-250
• Better bounds for incremental frequency allocation in bipartite graphs
  Marek Chrobak, Łukasz Jeż, Jiȓí Sgall
  Lecture Notes in Computer Science 6942, 2011, pp. 251-262
• Two-bounded-space bin packing revisited
  Marek Chrobak, Jiȓí Sgall, Gerhard J. Woeginger
  Lecture Notes in Computer Science 6942, 2011, pp. 263-274
• Output-sensitive listing of bounded-size trees in undirected graphs
  Rui Ferreira, Roberto Grossi, Romeo Rizzi
  Lecture Notes in Computer Science 6942, 2011, pp. 275-286
• Exact algorithm for the maximum induced planar subgraph problem
  Fedor V. Fomin, Ioan Todinca, Yngve Villanger
  Lecture Notes in Computer Science 6942, 2011, pp. 287-298