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:2934620
Jump to:navigation, search

zbMath1302.68326MaRDI QIDQ2934620

No author found.

Publication date: 18 December 2014


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


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)


Related Items (10)

A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments ⋮ Improved Algorithms for Bicluster Editing ⋮ Preference-based learning to rank ⋮ Kernels for feedback arc set in tournaments ⋮ Finding the closest ultrametric ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders ⋮ Linear programming based approximation algorithms for feedback set problems in bipartite tournaments ⋮ A note on generalized rank aggregation ⋮ Ranking tournaments with no errors. I: Structural description






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2934620&oldid=15910364"
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 20:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki