Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The jump number problem: exact and parameterized

From MaRDI portal
Publication:2867086
Jump to:navigation, search

DOI10.1007/978-3-319-03898-8_20zbMATH Open1406.68041OpenAlexW177577345MaRDI QIDQ2867086FDOQ2867086


Authors: Dieter Kratsch, Stefan Kratsch Edit this on Wikidata


Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_20




Recommendations

  • scientific article; zbMATH DE number 764417
  • Tackling the jump number of interval orders
  • Jump number maximization for proper interval graphs and series-parallel graphs
  • An optimal algorithm to find the jump number of partially ordered sets
  • An improved approximation ratio for the jump number problem on interval orders


Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)



Cited In (7)

  • Title not available (Why is that?)
  • An improved algorithm for the jump number problem
  • Jump number of dags having Dilworth number 2
  • The jump number of Z-free ordered sets
  • A tabu search approach to the jump number problem
  • Title not available (Why is that?)
  • Jump number problem: The role of matroids





This page was built for publication: The jump number problem: exact and parameterized

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867086)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2867086&oldid=15808415"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki