Hardness and approximation of submodular minimum linear ordering problems

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: 1 Online-Ressource.

Language: Englisch

Bibliographic citation: Hardness and approximation of submodular minimum linear ordering problems ; day:14 ; month:12 ; year:2023 ; pages:1-42
Mathematical programming ; (14.12.2023), 1-42

Creator: Farhadi, Majid
Gupta, Swati
Sun, Shengding
Tetali, Prasad
Wigal, Michael C.

Contributor: SpringerLink (Online service)

DOI: 10.1007/s10107-023-02038-z

URN: urn:nbn:de:101:1-2024022914183144220399

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:50 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Farhadi, Majid
Gupta, Swati
Sun, Shengding
Tetali, Prasad
Wigal, Michael C.
SpringerLink (Online service)

Other Objects (12)

Streaming approximation resistance of every ordering CSP

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

Better Hardness Results for the Minimum Spanning Tree Congestion Problem

Kapitel

Hardness

Hochschulschrift

The linear ordering problem: algorithms and applications

Hochschulschrift

Nicht-lineare Tschebyscheff-Approximation

Hochschulschrift

Nicht-lineare Tschebyscheff-Approximation

Hochschulschrift

Approximation linearer zeitinvarianter Systeme

Vorlesungen über lineare Approximation

Sachakte

Lineare Räume und Approximation :

Sachakte

Lineare Operatoren und Approximation :

Streaming approximation resistance of every ordering CSP

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

Better Hardness Results for the Minimum Spanning Tree Congestion Problem

Kapitel

Hardness

Hochschulschrift

The linear ordering problem: algorithms and applications

Hochschulschrift

Nicht-lineare Tschebyscheff-Approximation

Hochschulschrift

Nicht-lineare Tschebyscheff-Approximation

Hochschulschrift

Approximation linearer zeitinvarianter Systeme

Vorlesungen über lineare Approximation

Sachakte

Lineare Räume und Approximation :

Sachakte

Lineare Operatoren und Approximation :

Streaming approximation resistance of every ordering CSP

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

Better Hardness Results for the Minimum Spanning Tree Congestion Problem

Kapitel

Hardness

Hochschulschrift

The linear ordering problem: algorithms and applications

Hochschulschrift

Nicht-lineare Tschebyscheff-Approximation

Hochschulschrift

Nicht-lineare Tschebyscheff-Approximation

Hochschulschrift

Approximation linearer zeitinvarianter Systeme

Vorlesungen über lineare Approximation

Sachakte

Lineare Räume und Approximation :

Sachakte

Lineare Operatoren und Approximation :

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Hardness and approximation of submodular minimum linear ordering problems

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

Streaming approximation resistance of every ordering CSP

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

Better Hardness Results for the Minimum Spanning Tree Congestion Problem

Hardness

The linear ordering problem: algorithms and applications

Nicht-lineare Tschebyscheff-Approximation

Nicht-lineare Tschebyscheff-Approximation

Nicht-lineare Tschebyscheff-Approximation

Approximation linearer zeitinvarianter Systeme

Vorlesungen über lineare Approximation

Lineare Räume und Approximation :

Lineare Operatoren und Approximation :

Streaming approximation resistance of every ordering CSP

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

Better Hardness Results for the Minimum Spanning Tree Congestion Problem

Hardness

The linear ordering problem: algorithms and applications

Nicht-lineare Tschebyscheff-Approximation

Nicht-lineare Tschebyscheff-Approximation

Nicht-lineare Tschebyscheff-Approximation

Approximation linearer zeitinvarianter Systeme

Vorlesungen über lineare Approximation

Lineare Räume und Approximation :

Lineare Operatoren und Approximation :

Streaming approximation resistance of every ordering CSP

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

Better Hardness Results for the Minimum Spanning Tree Congestion Problem

Hardness

The linear ordering problem: algorithms and applications

Nicht-lineare Tschebyscheff-Approximation

Nicht-lineare Tschebyscheff-Approximation

Nicht-lineare Tschebyscheff-Approximation

Approximation linearer zeitinvarianter Systeme

Vorlesungen über lineare Approximation

Lineare Räume und Approximation :

Lineare Operatoren und Approximation :

Related objects

Reset password