Graph algorithms for planning and partitioning
暂无分享,去创建一个
[1] P. Enflo. On the nonexistence of uniform homeomorphisms betweenLp-spaces , 1970 .
[2] John L. Bruno,et al. Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Ronald V. Book,et al. Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness , 1980 .
[5] S. Vajda. Linear programming under uncertainty , 1981 .
[6] Alan M. Frieze,et al. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.
[7] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[8] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[9] Alexander V. Karzanov,et al. Metrics and undirected cuts , 1985, Math. Program..
[10] David B. Shmoys,et al. A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.
[11] R. Vohra,et al. The Orienteering Problem , 1987 .
[12] Alexander H. G. Rinnooy Kan,et al. Vehicle Routing with Time Windows , 1987, Oper. Res..
[13] Mwp Martin Savelsbergh,et al. VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .
[14] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[15] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[16] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[17] Nathan Linial,et al. Collective Coin Flipping , 1989, Adv. Comput. Res..
[18] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[19] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[20] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[21] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[22] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[23] John N. Tsitsiklis,et al. Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.
[24] M. G. Kantor,et al. The Orienteering Problem with Time Windows , 1992 .
[25] Tong Sun,et al. Algorithms for the vehicle routing problems with time deadlines , 1993 .
[26] Michael Kearns,et al. Efficient noise-tolerant learning from statistical queries , 1993, STOC.
[27] Mihalis Yannakakis,et al. The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..
[28] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[29] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[30] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[31] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.
[32] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.
[33] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[34] Kenneth L. Clarkson,et al. Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.
[35] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[36] Carsten Jordan. A TWO-PHASE GENETIC ALGORITHM TO SOLVE VARIANTS OF THE BATCH SEQUENCING PROBLEM , 1995 .
[37] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[38] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[39] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[40] David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
[41] Mihalis Yannakakis,et al. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..
[42] Emo Welzl. Suchen und Konstruieren durch Verdoppeln , 1996 .
[43] Wenceslas Fernandez de la Vega,et al. MAX-CUT has a randomized approximation scheme in dense graphs , 1996, Random Struct. Algorithms.
[44] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[45] J. Matousek,et al. On the distortion required for embedding finite metric spaces into normed spaces , 1996 .
[46] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[47] John R. Birge,et al. Introduction to Stochastic Programming , 1997 .
[48] Sam R. Thangiah,et al. Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .
[49] David R. Karger,et al. An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs , 1997, Information Processing Letters.
[50] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[51] Giri Narasimhan,et al. Resource-constrained geometric network optimization , 1998, SCG '98.
[52] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[53] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[54] Philip N. Klein,et al. A polynomial-time approximation scheme for weighted planar graph TSP , 1998, SODA '98.
[55] Ehud Friedgut,et al. Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..
[56] Santosh S. Vempala,et al. New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..
[57] M. Goemans. Semidefinite programming and combinatorial optimization , 1998 .
[58] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[59] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[60] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[61] Satish Rao,et al. Small distortion and volume preserving embeddings for planar and Euclidean metrics , 1999, SCG '99.
[62] Santosh S. Vempala,et al. A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..
[63] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .
[64] Sudipto Guha,et al. Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[65] Leonard J. Schulman,et al. Clustering for Edge-Cost Minimization , 1999, Electron. Colloquium Comput. Complex..
[66] Wen-Hwa Yang,et al. Survey of scheduling research involving setup times , 1999, Int. J. Syst. Sci..
[67] J. M. Sek. On embedding trees into uniformly convex Banach spaces , 1999 .
[68] Sanjeev Arora,et al. A 2+epsilon approximation algorithm for the k-MST problem , 2000, SODA.
[69] Marc Gravel,et al. Scheduling jobs in an Alcan aluminium foundry using a genetic algorithm , 2000 .
[70] Robert Krauthgamer,et al. A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[71] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.
[72] Marek Karpinski,et al. Approximation Hardness of TSP with Bounded Metrics , 2001, ICALP.
[73] László Lovász,et al. The cover time, the blanket time, and the Matthews bound , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[74] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[75] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[76] Sanjeev Arora,et al. A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.
[77] Hiroshi Nagamochi,et al. A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times , 2001, ESA.
[78] William W. Cohen,et al. Learning to Match and Cluster Entity Names , 2001 .
[79] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[80] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[81] R. Karp,et al. Algorithms for graph partitioning on the planted partition model , 2001 .
[82] Shai Ben-David,et al. Agnostic Boosting , 2001, COLT/EuroCOLT.
[83] Zhi-Zhong Chen,et al. Computing Phylogenetic Roots with Bounded Degrees and Errors , 2001, WADS.
[84] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[85] Loo Hay Lee,et al. Heuristic methods for vehicle routing problem with time windows , 2001, Artif. Intell. Eng..
[86] Richard M. Karp,et al. Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.
[87] Andrzej Lingas,et al. Approximation algorithms for time-dependent orienteering , 2001, Inf. Process. Lett..
[88] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..
[89] Nathan Linial. Finite metric spaces: combinatorics, geometry and algorithms , 2002, SCG '02.
[90] William W. Cohen,et al. Learning to match and cluster large high-dimensional data sets for data integration , 2002, KDD.
[91] D. Ron,et al. Testing the diameter of graphs , 2002 .
[92] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[93] Leslie Pack Kaelbling,et al. Nearly deterministic abstractions of Markov decision processes , 2002, AAAI/IAAI.
[94] Ron Shamir,et al. Improved algorithms for the random cluster graph model , 2002, Random Struct. Algorithms.
[95] I. Bárány. LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .
[96] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[97] Andrew McCallum,et al. Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference , 2003, IIWeb.
[98] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[99] Andrew McCallum,et al. Object Consolodation by Graph Partitioning with a Conditionally›Trained Distance Metric , 2003 .
[100] Robert Krauthgamer,et al. Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[101] Nicole Immorlica,et al. Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques , 2003, Lecture Notes in Computer Science.
[102] Satish Rao,et al. Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[103] Reuven Bar-Yehuda,et al. On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract , 2003, ESA.
[104] Yuri Rabinovich. On average distortion of embedding metrics into the line and into L1 , 2003, STOC '03.
[105] Amos Fiat,et al. Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs , 2003, ESA.
[106] Anupam Gupta,et al. Embedding k-outerplanar graphs into ℓ1 , 2003, SODA '03.
[107] Steven Skiena,et al. Integrating microarray data by consensus clustering , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.
[108] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[109] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[110] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[111] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[112] R. Ravi,et al. Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.
[113] George B. Dantzig,et al. Linear Programming Under Uncertainty , 2004, Manag. Sci..
[114] R. Ravi,et al. An edge in time saves nine: LP rounding approximation algorithms for stochastic network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[115] R. Schapire,et al. Toward efficient agnostic learning , 1992, COLT '92.
[116] R. Ravi,et al. Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..
[117] Uriel Feige,et al. On Systems of Linear Equations with Two Variables per Equation , 2004, APPROX-RANDOM.
[118] Anupam Gupta,et al. Cuts, Trees and ℓ1-Embeddings of Graphs* , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[119] Amit Kumar,et al. Maximum Coverage Problem with Group Budget Constraints and Applications , 2004, APPROX-RANDOM.
[120] Chaitanya Swamy,et al. Correlation Clustering: maximizing agreements via semidefinite programming , 2004, SODA '04.
[121] Robert Krauthgamer,et al. Measured descent: a new embedding method for finite metrics , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[122] Stephen P. Boyd,et al. Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..
[123] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[124] Nicole Immorlica,et al. On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.
[125] James R. Lee,et al. On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.
[126] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[127] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into 1 (Extended Abstract) , 2005 .
[128] Jan Vondrák,et al. Adaptivity and approximation for stochastic packing problems , 2005, SODA '05.
[129] R. Ravi,et al. What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization , 2005, APPROX-RANDOM.
[130] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[131] James R. Lee,et al. Extending Lipschitz functions via random metric partitions , 2005 .
[132] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[133] Reuven Bar-Yehuda,et al. On approximating a geometric prize-collecting traveling salesman problem with time windows , 2005, J. Algorithms.
[134] Venkatesan Guruswami,et al. Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[135] Chaitanya Swamy,et al. Network design for information networks , 2005, SODA '05.
[136] Yuval Rabani,et al. On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.
[137] Luca Trevisan,et al. Approximation algorithms for unique games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[138] James R. Lee,et al. Euclidean distortion and the sparsest cut , 2005, STOC '05.
[139] Santosh S. Vempala,et al. On The Approximability Of The Traveling Salesman Problem , 2006, Comb..