Library

X
Language
Preferred search index
Number of Hits per Page
Default Sort Criterion
Default Sort Ordering
Size of Search History
Default Email Address
Default Export Format
Default Export Encoding
Facet list arrangement
Maximum number of values per filter
Auto Completion
Feed Format
Maximum Number of Items per Feed
Permalink If you want to be able to use settings permanently, you must save your settings and then set a Bookmark to the permalink
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A note on degeneracy in linear programming (1986)
    Springer
    Mathematical programming 35 (1986), S. 365-367 
    Details
    ISSN: 1436-4646
    Keywords: Degeneracy ; strongly polynomial time ; randomized simplex
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that the problem of exiting a degenerate vertex is as hard as the general linear programming problem. More precisely, every linear programming problem can easily be reduced to one where the second best vertex (which is highly degenerate) is already given. So, to solve the latter, it is sufficient to exit that vertex in a direction that improves the objective function value.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580886
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Extending NC and RNC algorithms (1989)
    Springer
    Algorithmica 4 (1989), S. 511-517 
    Details
    ISSN: 1432-0541
    Keywords: Circuits ; Probabilistic circuits ; Poly-log depth ; Parametric problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A technique is presented by which NC and RNC algorithms for some problems can be extended into NC and RNC algorithms, respectively, that solve more general parametric problems. The technique is demonstrated on explicit bounded degree circuits. Applications include parametric extensions of the shortest-path and spanning-tree problems and, in particular, the minimum-ratio-cycle problem, showing all these problems are in NC.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01553905
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...