Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid

dblp
dblp
dblp
dblp

Not MPG Author(s):

Boros, Endre
Gurvich, Vladimir
Khachiyan, Leonid

Editor(s):



Not MPII Editor(s):

Toshihide Ibaraki,
Naoki Katoh,
Hirotaka Ono

BibTeX cite key*:

Elbassioni2003c

Title, Booktitle

Title*:

Algorithms for Enumerating Circuits in Matroids.


ISAAC2003.pdf (161.06 KB)

Booktitle*:

Algorithms and Computation, 14th International Symposium, ISAAC 2003

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Kyoto, Japan

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

15 December 2003

Event End Date:

17 December 2003

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

2906

Number:


Month:

December

Pages:

485-494

Year*:

2003

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We present an incremental polynomial-time algorithm for enumerating all circuits of a matroid or, more generally,
all minimal spanning sets for a flat. This result implies, in particular, that for a given infeasible system of linear equations, all its maximal feasible subsystems, as well as all minimal infeasible subsystems, can be enumerated in incremental polynomial time. We also show the NP-hardness of several related enumeration problems.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Elbassioni2003c,
AUTHOR = {Boros, Endre and Elbassioni, Khaled M. and Gurvich, Vladimir and Khachiyan, Leonid},
TITLE = {Algorithms for Enumerating Circuits in Matroids.},
BOOKTITLE = {Algorithms and Computation, 14th International Symposium, ISAAC 2003},
PUBLISHER = {Springer},
YEAR = {2003},
VOLUME = {2906},
PAGES = {485--494},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Kyoto, Japan},
MONTH = {December},
}


Entry last modified by Christine Kiesel, 07/15/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
02/22/2005 07:47:38 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Christine Kiesel
Khaled Elbassioni
Khaled Elbassioni
Edit Dates
02.05.2007 15:39:59
02.06.2006 15:18:12
04/20/2006 06:38:04 PM
02/22/2005 07:47:38 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
ISAAC2003.pdf