Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath0968.68190MaRDI QIDQ2701740

Juraj Hromkovič

Publication date: 19 February 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hard algorithmical problems


Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)


Related Items (6)

On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ On the approximability and hardness of minimum topic connected overlay and its special instances ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Monitoring the edges of a graph using distances ⋮ Unrelated parallel machine scheduling -- perspectives and progress


Uses Software

  • TSPLIB
  • MAX-2-SAT
  • Genocop
  • Algorithm 447





This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2701740&oldid=15541594"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 10:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki