暂无分享,去创建一个
[1] Adrian Vetta,et al. The Demand Matching Problem , 2002, IPCO.
[2] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[3] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[4] Rajmohan Rajaraman,et al. Coupled and k-Sided Placements: Generalizing Generalized Assignment , 2014, IPCO.
[5] Ken-ichi Kawarabayashi,et al. Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[6] Takuro Fukunaga,et al. Network design with weighted degree constraints , 2010, Discret. Optim..
[7] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[8] Morteza Zadimoghaddam,et al. Spanning trees with minimum weighted degrees , 2007, Inf. Process. Lett..
[9] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[10] Aravind Srinivasan,et al. Solving Packing Integer Programs via Randomized Rounding with Alterations , 2012, Theory Comput..
[11] Maw-Sheng Chern,et al. A Note on Approximation Schemes for Multidimensional Knapsack Problems , 1984, Math. Oper. Res..
[12] Fabrizio Grandoni,et al. A Mazing 2+∊ Approximation for Unsplittable Flow on a Path , 2014, SODA.
[13] Georgii Gens,et al. Complexity of approximation algorithms for combinatorial problems: a survey , 1980, SIGA.
[14] Ojas Parekh. Iterative Packing for Demand and Hypergraph Matching , 2011, IPCO.
[15] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[16] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[17] Yuval Rabani,et al. An improved approximation algorithm for resource allocation , 2011, TALG.