新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

NeilInCanadia approximation [23 articles]

最近 NeilInCanadia さんのライブラリに追加された論文の中から タグ approximation. You can also see everyone's approximation.
  • Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
    Journal of the ACM, Vol. 46, No. 6. (November 1999), pp. 787-832.
    by Tom Leighton, Satish Rao
    posted to approximation network_flow by NeilInCanadia on 2007-11-16 16:18:46 as ** along with 2 people tmmurali mohits
  • A primal-dual approximation algorithm for generalized steiner network problems
    Combinatorica, Vol. 15, No. 3. (1995), pp. 435-454.
    by David P Williamson, Michel X Goemans, Milena Mihail, Vijay V Vazirani
    posted to approximation steiner by NeilInCanadia on 2007-11-14 03:37:43 as **
  • Approximation Algorithms
    (22 March 2004)
    by Vijay V Vazirani
    posted to approximation books by NeilInCanadia on 2007-11-14 03:37:02 as read along with 2 people rocarvaj ethkim
  • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    Combinatorica, Vol. 7, No. 4. (23 December 1987), pp. 365-374.
    by Prabhakar Raghavan, Clark Tompson
    posted to approximation rounding by NeilInCanadia on 2007-11-13 04:19:51 as **
  • Packing cycles in undirected graphs
    Journal of Algorithms, Vol. 48, No. 1. (August 2003), pp. 239-256.
    by Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    posted to approximation cycle_packing by NeilInCanadia on 2007-10-28 18:49:32 as **
  • A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
    SIAM J. Discret. Math., Vol. 12, No. 3. (September 1999), pp. 289-297.
    by Vineet Bafna, Piotr Berman, Toshihiro Fujito
    posted to approximation by NeilInCanadia on 2007-10-25 22:30:16 as ** along with 1 person yylin
  • Approximation algorithms and hardness for domination with propagation
    (10 Oct 2007)
    by Ashkan Aazami, Michael D Stilp
    posted to approximation by NeilInCanadia on 2007-10-12 23:09:45 as **
  • New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs
    Graph-Theoretic Concepts in Computer Science: 28th International Workshop, WG 2002,: eský Krumlov, Czech Republic, June 13-15, 2002. Revised Papers (2002), pp. 282-295.
    by Ton Kloks, CM Lee, Jiping Liu
    posted to approximation by NeilInCanadia on 2007-10-10 22:04:24 as **
  • The Parking Permit Problem
    (2005), pp. 274-284.
    by Adam M Meyerson
    posted to approximation by NeilInCanadia on 2007-07-26 17:56:22 as **
  • Hardness of Approximation
    by Sanjeev Arora, Carsten Lund
    edited by Dorit Hochbaum
    posted to approximation by NeilInCanadia on 2007-04-21 03:48:30 as ***
  • Covering rectilinear polygons with axis-parallel rectangles
    (1999), pp. 445-454.
    by Anil VS Kumar, H Ramesh
    posted to approximation by NeilInCanadia on 2007-04-14 22:19:22 as **
  • On the approximability of some maximum spanning tree problems
    Theoretical Computer Science, Vol. 181, No. 1. (15 July 1997), pp. 107-118.
    by Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
    posted to approximation by NeilInCanadia on 2007-03-19 02:48:31 as **
  • Inapproximability Results for Guarding Polygons and Terrains
    Algorithmica, Vol. V31, No. 1. (1 January 2001), pp. 79-113.
    by S Eidenbenz, C Stamm, P Widmayer
    posted to approximation by NeilInCanadia on 2006-10-27 23:19:43 as **
  • Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
    Lecture Notes in Computer Science : Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002. Proceedings (2002), 60.
    by Stephan Eidenbenz
    posted to approximation by NeilInCanadia on 2006-10-27 23:17:30 as **
  • Inapproximability of Combinatorial Optimization Problems
    (24 Sep 2004)
    by Luca Trevisan
    posted to approximation by NeilInCanadia on 2006-10-16 02:49:54 as ** along with 4 people and 2 groups ansobol BarrosH entropy camu Crypto Randomness
  • Asymmetric <i>k</i>-center is log<sup>*</sup> <i>n</i>-hard to approximate
    J. ACM, Vol. 52, No. 4. (July 2005), pp. 538-551.
    by Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph ( Naor
    posted to approximation by NeilInCanadia on 2006-10-15 00:57:09 as **
  • An <italic>O</italic>(log<supscrpt>*</supscrpt><italic>n</italic>) approximation algorithm for the asymmetric <italic>p</italic>-center problem
    (1996), pp. 1-5.
    by Sundar Vishwanathan
    posted to approximation by NeilInCanadia on 2006-10-15 00:55:42 as **
  • Single-minded unlimited supply pricing on sparse instances
    (2006), pp. 1093-1102.
    by Patrick Briest, Piotr Krysta
    posted to approximation by NeilInCanadia on 2006-08-12 22:15:36 as ***
  • On profit-maximizing envy-free pricing
    (2005), pp. 1164-1173.
    by Venkatesan Guruswami, Jason D Hartline, Anna R Karlin, David Kempe, Claire Kenyon, Frank Mcsherry
    posted to approximation by NeilInCanadia on 2006-08-07 19:30:27 as **
  • Approximation Algorithms and Online Mechanisms for Item Pricing
    (2006), pp. 29-35.
    by MF Balcan, A Blum
    posted to approximation by NeilInCanadia on 2006-08-07 04:37:06 as **
  • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    J. ACM, Vol. 42, No. 6. (November 1995), pp. 1115-1145.
    by Michel X Goemans, David P Williamson
    posted to approximation by NeilInCanadia on 2006-06-13 23:20:03 as **** along with 2 people BarrosH pcarbo
  • Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?
    Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on (2004), pp. 146-154.
    by S Khot, G Kindler, E Mossel, R O'Donnell
    posted to approximation by NeilInCanadia on 2006-06-13 23:17:19 as **
  • Near-optimal algorithms for unique games
    (2006), pp. 205-214.
    by Moses Charikar, Konstantin Makarychev, Yury Makarychev
    posted to approximation by NeilInCanadia on 2006-06-13 23:10:24 as **
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/NeilInCanadia/tag/approximation

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.