scientific article; zbMATH DE number 7525513
From MaRDI portal
Publication:5075824
DOI10.4230/LIPICS.ESA.2019.76MaRDI QIDQ5075824FDOQ5075824
Authors: Marcel Radermacher, Ignaz Rutter 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.01243
Title of this publication is not available (Why is that?)
Recommendations
- A Geometric Heuristic for Rectilinear Crossing Minimization
- scientific article; zbMATH DE number 1109408
- scientific article; zbMATH DE number 1487879
- Efficient randomized algorithms for some geometric optimization problems
- scientific article; zbMATH DE number 1500682
- Crossing minimization in linear embeddings of graphs
- Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
- Approximating Crossing Minimization in Radial Layouts
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- scientific article; zbMATH DE number 1974113
Cites Work
- The University of Florida sparse matrix collection
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- Algorithms for Reporting and Counting Geometric Intersections
- Crossing Number is NP-Complete
- Drawing large graphs by multilevel maxent-stress optimization
- Generating Random Regular Graphs Quickly
- Title not available (Why is that?)
- Graph Drawing
- Relative \((p,\varepsilon )\)-approximations in geometry
- Some provably hard crossing number problems
- Inserting an edge into a planar graph
- Improved bounds on the sample complexity of learning
- Computational search of small point sets with small rectilinear crossing number
- A heuristic approach towards drawings of graphs with high crossing resolution
- A greedy heuristic for crossing-angle maximization
- Inserting multiple edges into a planar graph
- A Geometric Heuristic for Rectilinear Crossing Minimization
Cited In (7)
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- Computational search of small point sets with small rectilinear crossing number
- An SDP approach to multi-level crossing minimization
- Inserting an edge into a geometric embedding
- A Geometric Heuristic for Rectilinear Crossing Minimization
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS
- Title not available (Why is that?)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075824)
