Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5909298
@@ Property / zbMATH DE Number: 5909298 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph orientation
@@ Property / zbMATH Keywords: graph orientation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+degree
@@ Property / zbMATH Keywords: degree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inapproximability
@@ Property / zbMATH Keywords: inapproximability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum flow
@@ Property / zbMATH Keywords: maximum flow / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-009-9276-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2119344260
@@ Property / OpenAlex ID: W2119344260 / rank @@
+Normal rank
@@ Property / cites work @@
+GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
+Normal rank
@@ Property / cites work @@
+Balanced vertex-orderings of graphs
@@ Property / cites work: Balanced vertex-orderings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024792
@@ Property / cites work: Q3024792 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar orientations with low out-degree and compaction of adjacency matrices
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem in plane geometry
@@ Property / cites work: A combinatorial theorem in plane geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximating the oriented diameter of chordal graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Deterministic Maximum Flow Algorithm
@@ Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization in geometry
@@ Property / cites work: Combinatorial optimization in geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / cites work @@
+Minimizing maximum indegree
@@ Property / cites work: Minimizing maximum indegree / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:543514