Approximation Schemes for Multi-Budgeted Independence Systems
暂无分享,去创建一个
[1] Refael Hassin,et al. An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection , 2004, SIAM J. Comput..
[2] Arthur Warburton,et al. Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Amos Fiat,et al. Algorithms - ESA 2009 , 2009, Lecture Notes in Computer Science.
[5] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[6] R. Ravi,et al. The Constrained Minimum Spanning Tree Problem (Extended Abstract) , 1996, SWAT.
[7] Sorin C. Popescu,et al. Lidar Remote Sensing , 2011 .
[8] R. Ravi,et al. Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.
[9] Mohit Singh,et al. On the Crossing Spanning Tree Problem , 2004, APPROX-RANDOM.
[10] Éva Tardos,et al. How to tidy up your set-system? , 1988 .
[11] William R. Pulleyblank,et al. Exact arborescences, matchings and cycles , 1987, Discret. Appl. Math..
[12] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[13] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[14] Francesco Maffioli,et al. Random Pseudo-Polynomial Algorithms for Exact Matroid Problems , 1992, J. Algorithms.
[15] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.
[16] Chandra Chekuri,et al. Dependent Randomized Rounding for Matroid Polytopes and Applications , 2009, 0909.4348.
[17] R. Ravi,et al. Matching Based Augmentations for Approximating Connectivity Problems , 2006, LATIN.
[18] Kamal Jain,et al. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[19] Fabrizio Grandoni,et al. Budgeted matching and budgeted matroid intersection via the gasoline puzzle , 2008, Math. Program..
[20] W. Marsden. I and J , 2012 .
[21] K. Mulmuley. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..
[22] R. Ravi,et al. Rapid rumor ramification: approximating the minimum broadcast time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[23] Yash P. Aneja,et al. Minimal spanning tree subject to a side constraint , 1982, Comput. Oper. Res..
[24] R. Ravi,et al. Bicriteria Network Design Problems , 1998, J. Algorithms.
[25] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[26] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[27] Andrzej Lingas,et al. Algorithm Theory — SWAT'96 , 1996, Lecture Notes in Computer Science.
[28] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[29] Bernhard Korte,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[30] Danny Raz,et al. A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..
[31] Mohit Singh,et al. Iterative Rounding for Multi-Objective Optimization Problems , 2009, ESA.