Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415): Difference between revisions

@@ Property / cites work @@
+Exact arborescences, matchings and cycles
@@ Property / cites work: Exact arborescences, matchings and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Random pseudo-polynomial algorithms for exact matroid problems
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized polymatroids and submodular flows
@@ Property / cites work: Generalized polymatroids and submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
+Normal rank
@@ Property / cites work @@
+A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
+Normal rank
@@ Property / cites work @@
+On matroid intersection adjacency
@@ Property / cites work: On matroid intersection adjacency / rank @@
+Normal rank
@@ Property / cites work @@
+A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
+Normal rank
@@ Property / cites work @@
+The dependence graph for bases in matroids
@@ Property / cites work: The dependence graph for bases in matroids / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Approximation Schemes for Multidimensional Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization with Rational Objective Functions
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Real-time scheduling with a budget
@@ Property / cites work: Real-time scheduling with a budget / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+Many birds with one stone
@@ Property / cites work: Many birds with one stone / rank @@
+Normal rank
@@ Property / cites work @@
+Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Q3140449
@@ Property / cites work: Q3140449 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank