Pith. sign in

REVIEW

Output-sensitive Complexity of Multiobjective Combinatorial Optimization

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1610.07204 v1 pith:F7SBMQB3 submitted 2016-10-23 math.OC cs.CCcs.DS

Fritz Bökler , Matthias Ehrgott , Christopher Morris , Petra Mutzel This is my paper · ORCID
classification math.OCcs.CCcs.DS
keywords complexityalgorithmefficientoutput-sensitiveproblemscombinatorialexistsmultiobjective
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of MOCO problems for which such an efficient algorithm exists as well as problems for which no efficient algorithm exists under mild complexity theoretic assumptions.

Discussion (0). Continue with ORCID to comment.

Pith tools